Skip to Main content Skip to Navigation
Conference papers

Decentralized Vs. Centralized Sequencing in a Complex Job-Shop Scheduling

Abstract : Allocation of jobs to machines and subsequent sequencing each machine is known as job scheduling problem. Classically, both operations are done in a centralized and static/offline structure, considering some assumptions about the jobs and machining environment. Today, with the advent of Industry 4.0, the need to incorporate real-time data in the scheduling decision process is clear and facilitated. Recently, several studies have been conducted on the collection and application of distributed data in real-time of operations, e.g., job scheduling and control. In practice, pure distribution and decentralization is not yet fully realizable because of e.g., transformation complexity and classical resistance to change. This paper studies a combination of decentralized sequencing and central optimum allocation in a lithography job-shop problem. It compares the level of applicability of two decentralized algorithms against the central scheduling. The results show better relative performance of sequencing in stochastic cases.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Monday, December 18, 2017 - 10:40:25 AM
Last modification on : Monday, December 18, 2017 - 11:01:31 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Afshin Mehrsai, Gonçalo Figueira, Nicolau Santos, Pedro Amorim, Bernardo Almada-Lobo. Decentralized Vs. Centralized Sequencing in a Complex Job-Shop Scheduling. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2017, Hamburg, Germany. pp.467-474, ⟨10.1007/978-3-319-66923-6_55⟩. ⟨hal-01666204⟩



Les métriques sont temporairement indisponibles