Modelling and performance of distributed algorithm for scheduling dissimilar machines with set-up

Modelling and performance of distributed algorithm for scheduling dissimilar machines with set-up

0.00 Avg rating0 Votes
Article ID: iaor20042053
Country: United Kingdom
Volume: 41
Issue: 18
Start Page Number: 4357
End Page Number: 4382
Publication Date: Jan 2003
Journal: International Journal of Production Research
Authors: ,
Abstract:

Distributed arrival time control is a highly decentralised scheduling approach where each part entity autonomously controls its arrival time to meet the due-date in real time. This paper presents differential equation-based models for distributed arrival time control of parallel dissimilar machines including sequence-dependent set-up and flowshop scheduling. The main objective was to show that the behaviour of general systems under distributed arrival time control was predictable. Convergence properties of the resulting nonlinear systems were established using the theory of discontinuous differential equations. Geometry was used to gain insight into the behaviour of these nonlinear systems. An approximation model was proposed for mean arrival times when the dynamics resulted in a non-unique steady-state. The model was tested using numerical simulation and agreed well. Geometric insights were also used to investigate scheduling performance of distributed arrival time control. Simulation results indicated that distributed arrival time control could provide significant improvement, typically more than 20%, over commonly used dispatching rules for due-date-based measures. Improved predictability and favourable performance made distributed arrival time control an attractive approach for decentralized control of Just-In-Time production.

Reviews

Required fields are marked *. Your email address will not be published.