Job Scheduling in Virtual Manufacturing Cells With Lot-Streaming Strategy: A New Mathematical Model Formulation and a Genetic Algorithm Approach

Basit Öğe Kaydı
dc.contributor.authorKesen, S. E.
dc.contributor.authorGungor, Z.
dc.date.accessioned2020-03-26T18:30:46Z
dc.date.available2020-03-26T18:30:46Z
dc.date.issued2012
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThis paper discusses the job scheduling problem in virtual manufacturing cells (VMCs) with the objective of makespan minimization. In the VMC scheduling problem, each job undergoes different processing routes and there is a set of machines to process any operation. Jobs are produced in lot and lot-streaming is permitted. In addition, machines are distributed through the facility, which raises the travelling time issue. For this reason, the decisions are machine assignments, starting times and sub-lot sizes of the operations. We develop a new Mixed Integer Linear Programming (MILP) formulation that considers all aspects of the problem. Owing to the intractability matter, it is unlikely that the MILP could provide solutions for big-sized instances within a reasonable amount of time. We therefore present a Genetic Algorithm (GA) with a new chromosome structure for the VMC environment. Based on a wide range of examinations, comparative results show that GA is quite favourable and that it obtains the optimum solution for any of the instances in the case where sub-lot number equals 1.en_US
dc.description.sponsorshipSelcuk University (BAP)Selcuk Universityen_US
dc.description.sponsorshipThe authors are indebted to two anonymous referees for their constructive and helpful comments, which led to a big improvement of the paper. This research is partially supported by Selcuk University Scientific Research Project Fund (BAP).en_US
dc.identifier.citationKesen, S. E., Gungor, Z., (2012). Job Scheduling in Virtual Manufacturing Cells With Lot-Streaming Strategy: A New Mathematical Model Formulation and a Genetic Algorithm Approach. Journal of the Operational Research Society, (63), 683-695. Doi:10.1057/jors.2011.86
dc.identifier.doi10.1057/jors.2011.86en_US
dc.identifier.endpage695en_US
dc.identifier.issn0160-5682en_US
dc.identifier.issn1476-9360en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage683en_US
dc.identifier.urihttps://dx.doi.org/10.1057/jors.2011.86
dc.identifier.urihttps://hdl.handle.net/20.500.12395/28176
dc.identifier.volume63en_US
dc.identifier.wosWOS:000302893300011en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorKesen, S. E.
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofJournal of the Operational Research Societyen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectschedulingen_US
dc.subjectvirtual manufacturing cells (VMCs)en_US
dc.subjectflexible job-shop scheduling problemen_US
dc.subjectlot-streamingen_US
dc.subjectinteger programmingen_US
dc.subjectgenetic algorithmsen_US
dc.titleJob Scheduling in Virtual Manufacturing Cells With Lot-Streaming Strategy: A New Mathematical Model Formulation and a Genetic Algorithm Approachen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
28176.pdf
Boyut:
227.43 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü/Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu