Please use this identifier to cite or link to this item:
Title: Decentralized Vs. Centralized Sequencing in a Complex Job-Shop Scheduling
Authors: Afshin Mehrsai
Gonçalo Reis Figueira
Pedro Amorim
Bernardo Almada-Lobo
Issue Date: 2017
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. © IFIP International Federation for Information Processing 2017.
metadata.dc.type: conferenceObject
Appears in Collections:CEGI - Articles in International Conferences

Files in This Item:
File Description SizeFormat 
  Restricted Access
342.48 kBAdobe PDFView/Open Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.