By Topic

Rolling Partial Rescheduling Driven by Disruptions on Single-machine Based on Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bing Wang ; Department of Automation, School of Information Engineering, Shandong University at Weihai, Shandong 264209, People's Republic of China. Telephone number: 0086-0631-2982649; fax: 0086-0631-5688338; e-mail: ; Xiaoying Hong

This paper discusses large-scale single-machine rescheduling problems with efficiency and stability as bi-criterion, where more than one disruption arises during the execution of an initial schedule. Partial rescheduling (PR), which involves only partial unfinished schedules, is adopted in response to each disruption and forms a PR sub-problem. The remaining unfinished schedule is just right-shifted or not following the solution of PR sub-problem. During the process of schedule execution, a rolling PR strategy is driven by disruption events. Each global rescheduling consisting of two segments of local rescheduling revises the original schedule into a new schedule, which is exactly the next original schedule. Two types of local objective functions are designed for PR sub-problems locating in the process or the terminal of original schedules respectively, where the global information of bi-criterion problems is reflected to an extent. The analytical results demonstrate that each local PR objective is consistent to the global one. For PR sub-problems with such a particular criteria, a genetic algorithm is used to solve it. Extensive computational experiments were performed. Computational results show that the rolling PR can greatly improve schedule stability with a little sacrifice in schedule efficiency and consistently outperforms the rolling right-shift rescheduling. The rolling PR strategy is effective to address large-scale rescheduling problems with more disruptions

Published in:

2007 IEEE Symposium on Computational Intelligence in Scheduling

Date of Conference:

1-5 April 2007