Rolling partial rescheduling with efficiency and stability based on local search algorithm

Authors:
Bing Wang;Tao Liu
Affiliations:
Department of Automation, Shandong University at Weihai, Weihai, China;School of Automobile Engineering, Harbin Institute of Technology at Weihai, Weihai, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Year:
2006

Citing 2
Cited 0

One-machine rescheduling heuristics with efficiency and stability as criteria

Computers and Operations Research
Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the single-machine large-scale rescheduling problem with efficiency and stability as criteria, where more disruptions arise during the execution of schedule. A rolling strategy is driven by disruption events and the reactive partial rescheduling (PR) is adopted at each disruption. Two types of PR sub-problem are designed respectively for the procedural and the terminal PR-horizons. A local search algorithm is used to solve the PR sub-problems. Computational results show that the rolling PR can greatly improve the schedule stability with little sacrifice in schedule efficiency and consistently outperforms the rolling RSR.