Decentralized Vs. Centralized Sequencing in a Complex Job-Shop Scheduling - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

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

(1) , (1) , (1) , (1) , (1)
1

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.
Fichier principal
Vignette du fichier
456370_1_En_55_Chapter.pdf (342.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01666204 , version 1 (18-12-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
131 View
78 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More