On the reactive scheduling design using flexible predictive schedules

We consider single machine scheduling problem with dynamic job arrival and total weighted tardiness and makespan as objective functions. The machine is subject to disruptions related to late raw material arrival and machine breakdowns. We propose several reactive algorithms to guide the execution of...

Full description

Saved in:
Bibliographic Details
Published inIEEE International Conference on Systems, Man and Cybernetics Vol. 7; p. 6 pp. vol.7
Main Author Aloulou, M.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Dynamic scheduling
Electric breakdown
Job design
Job shop scheduling
Optimal scheduling
Raw materials
Robustness
Scheduling algorithm
Single machine scheduling
Uncertainty
Online AccessGet full text
ISBN0780374371
9780780374379
ISSN1062-922X
DOI10.1109/ICSMC.2002.1175715

Cover

More Information
Summary:We consider single machine scheduling problem with dynamic job arrival and total weighted tardiness and makespan as objective functions. The machine is subject to disruptions related to late raw material arrival and machine breakdowns. We propose several reactive algorithms to guide the execution of the jobs and to hedge against the presence of perturbations in the shop floor. These algorithms are based on flexible predictive schedules characterized by a partial order of jobs. The efficiency of these algorithms is shown through some computational experiments.
ISBN:0780374371
9780780374379
ISSN:1062-922X
DOI:10.1109/ICSMC.2002.1175715