By Topic

Local Rescheduling - A Novel Approach for Efficient Response to Schedule Disruptions

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

3 Author(s)
Jurgen Kuster ; Institute of Business Informatics and Application Systems, University of Klagenfurt, Universitätsstraße 65-67, 9020 Klagenfurt, Austria. e-mail: ; Dietmar Jannach ; Gerhard Friedrich

Whenever an unforeseen disturbance occurs during the execution of scheduled operations, rescheduling might be necessary: Beside temporal shifts and the allocation of alternative resources, also potential switches from one process variant to another one have typically to be considered. In realistic scenarios of operational disruption management (DM) the high number of potential options makes the provision of online decision support complex. It is thus necessary to significantly reduce the size of the regarded (search) problems which can for instance be achieved by applying methods of partial rescheduling. However, existing approaches such as affected operations rescheduling (AOR) or matchup scheduling (MUP) focus on production-specific problems and can not be applied to more generic problem classes. To overcome this limitation, we introduce a novel approach to partial rescheduling in this paper: local rescheduling (LRS) is based on the incremental extension of a time window which is regarded for potential schedule modifications. We discuss how this time window can be initialized, extended and used for rescheduling. Moreover, we illustrate the superior performance of LRS in comparison with full rescheduling and MUP

Published in:

2007 IEEE Symposium on Computational Intelligence in Scheduling

Date of Conference:

1-5 April 2007