Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns

Authors:
Haruhiko Suwa;Hiroaki Sandoh
Affiliations:
Department of Industrial and Systems Engineering, Setsunan University, 17-8, Ikedanaka-machi, Neyagawa, Osaka 5728508, Japan;Graduate School of Economics, Osaka University, 1-7, Machikaneyama-cho, Toyonaka, Osaka 5600043, Japan
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 3
Cited 1

One-machine rescheduling heuristics with efficiency and stability as criteria

Computers and Operations Research
CABINS: a framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair

Artificial Intelligence - Special volume on planning and scheduling
Knowledge-Based Approaches for Scheduling Problems: A Survey

IEEE Transactions on Knowledge and Data Engineering

On the identical parallel-machine rescheduling with job rework disruption

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new when-to-schedule policy in reactive scheduling, which considers timing of schedule revision based on the concept of a control limit policy. Under the proposed policy, schedule revision is carried out based on a cumulative task delay which can be a measure to determine suitable timing of schedule revision. Some computational experiments demonstrate the effectiveness of the proposed policy by applying it to job shop problems with machine breakdowns, where we minimize maximum tardiness as well as scheduling frequency. It is also shown that the proposed policy with even low scheduling frequency can outperform an event-driven rescheduling approach, which is one of the major effective reactive scheduling methods.