DSpace@Çankaya

Scheduling With Lot Streaming In A Two-Machine Re-Entrant Flow Shop

Basit öğe kaydını göster

dc.contributor.author Çetinkaya, Ferda Can
dc.contributor.author Duman, Mehmet
dc.date.accessioned 2024-05-09T11:19:35Z
dc.date.available 2024-05-09T11:19:35Z
dc.date.issued 2021
dc.identifier.citation Çetinkaya, Ferda Can; Duman, Mehmet. (2021). "Scheduling With Lot Streaming In A Two-Machine Re-Entrant Flow Shop", Operational Research in Engineering Sciences: Theory and Applications, Vol.4, No.3, pp.142-175. tr_TR
dc.identifier.issn 26201607
dc.identifier.uri http://hdl.handle.net/20.500.12416/8225
dc.description.abstract Lot streaming is splitting a job-lot of identical items into several sublots (portions of a lot) that can be moved to the next machines upon completion so that operations on successive machines can be overlapped; hence, the overall performance of a multi-stage manufacturing environment can be improved. In this study, we consider a scheduling problem with lot streaming in a two-machine re-entrant flow shop in which each job-lot is processed first on Machine 1, then goes to Machine 2 for its second operation before it returns to the primary machine (either Machine 1 or Machine 2) for the third operation. For the two cases of the primary machine, both single-job and multi-job cases are studied independently. Optimal and near-optimal solution procedures are developed. Our objective is to minimize the makespan, which is the maximum completion time of the sublots and job lots in the single-job and multi-job cases, respectively. We prove that the single-job problem is optimally solved in polynomial-time regardless of whether the third operation is performed on Machine 1 or Machine 2. The multi-job problem is also optimally solvable in polynomial time when the third operation is performed on Machine 2. However, we prove that the multi-job problem is NP-hard when the third operation is performed on Machine 1. A global lower bound on the makespan and a simple heuristic algorithm are developed. Our computational experiment results reveal that our proposed heuristic algorithm provides optimal or near-optimal solutions in a very short time. tr_TR
dc.language.iso eng tr_TR
dc.relation.isversionof 10.31181/ORESTA111221142C tr_TR
dc.rights info:eu-repo/semantics/openAccess tr_TR
dc.subject Lot Streaming tr_TR
dc.subject Makespan tr_TR
dc.subject Re-Entrant Flow Shop tr_TR
dc.subject Scheduling tr_TR
dc.subject Two-Machine tr_TR
dc.title Scheduling With Lot Streaming In A Two-Machine Re-Entrant Flow Shop tr_TR
dc.type article tr_TR
dc.relation.journal Operational Research in Engineering Sciences: Theory and Applications tr_TR
dc.contributor.authorID 50129 tr_TR
dc.identifier.volume 4 tr_TR
dc.identifier.issue 3 tr_TR
dc.identifier.startpage 142 tr_TR
dc.identifier.endpage 175 tr_TR
dc.contributor.department Çankaya Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü tr_TR


Bu öğenin dosyaları:

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster