Single-Machine partial rescheduling with bi-criterion based on genetic algorithm

Authors:
Bing Wang;Xiaoping Lai;Lifeng Xi
Affiliations:
School of Information Engineering, Shandong University at Weihai, Weihai, China;School of Information Engineering, Shandong University at Weihai, Weihai, China;School of Mechanical Engineering, Shanghai Jiaotong University, Shanghai, China
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Year:
2005

Citing 3
Cited 0

Matchup scheduling with multiple resources, release dates and disruptions

Operations Research
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

A partial rescheduling (PR) heuristic is presented for single machine with unforeseen breakdowns. Unlike a full rescheduling strategy where all unfinished jobs are considered, a PR strategy reschedules partial unfinished jobs which form a PR problem, and shifts the rest jobs to the right according to the solution of the PR problem. The rescheduling problem considers a bi-criterion that optimizes both shop efficiency (i.e. makespan performance of the schedule) and stability (i.e. deviation from the original schedule). A genetic algorithm is developed to solve the PR problem. Extensive computational testing was conducted. The computational results show that the PR heuristic with bi-criterion can significantly improve schedule stability with little sacrifice in efficiency, and provide a reasonable trade-off between solution quality and computational efforts.