Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
TLDR
In this article, the authors consider the rescheduling of operations with release dates and multiple resources when disruptions prevent the use of a preplanned schedule, and the overall strategy is to follow the preschedule until a disruption occurs.Abstract:Â
This paper considers the rescheduling of operations with release dates and multiple resources when disruptions prevent the use of a preplanned schedule. The overall strategy is to follow the preschedule until a disruption occurs. After a disruption, part of the schedule is reconstructed to match up with the preschedule at some future time. Conditions are given for the optimality of this approach. A practical implementation is compared with the alternatives of preplanned static scheduling and myopic dynamic scheduling. A set of practical test problems demonstrates the advantages of the matchup approach. We also explore the solution of the matchup scheduling problem and show the advantages of an integer programming approach for allocating resources to jobs.read more
Citations
More filters
Journal ArticleDOI
Project scheduling under uncertainty: survey and research potentials
Willy Herroelen,Roel Leus +1 more
TL;DR: The fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, fuzzy project Scheduling, robust (proactive) scheduling and sensitivity analysis are reviewed.
Journal ArticleDOI
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
TL;DR: A framework for understanding rescheduling strategies, policies, and methods based on a wide variety of experimental and practical approaches that have been described in the rescheduled literature is described.
Journal ArticleDOI
A survey of dynamic scheduling in manufacturing systems
Djamila Ouelhadj,Sanja Petrovic +1 more
TL;DR: The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing research on dynamic scheduling, and the principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristic, multi-agent systems, and other artificial intelligence techniques are described in detail.
Journal ArticleDOI
Executing production schedules in the face of uncertainties: a review and some future directions
TL;DR: The literature on executing production schedules in the presence of unforeseen disruptions on the shop floor is reviewed, and a taxonomy of the different types of uncertainty faced by scheduling algorithms is provided.
Journal ArticleDOI
The dynamic berth allocation problem for a container port
TL;DR: In this paper, the problem of determining a dynamic berth assignment to ships in the public berth system is addressed, and a heuristic procedure based on the Lagrangian relaxation of the original problem is developed.
References
More filters
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Journal ArticleDOI
A Review of Production Scheduling
TL;DR: The intent of this paper is to present a broad classification for various scheduling problems, to review important theoretical developments for these problem classes, and to contrast the currently available theory with the practice of production scheduling.
Journal ArticleDOI
Evaluation of a
TL;DR: This article tells how a hospital nursing director sought out and effectively used an educational nurse consultant to help establish a more unified, progressive working group in a health institution, including a three-year school for nurses, as well as the department of nursing.
Book
Machine Scheduling Problems: Classification, complexity and computations
TL;DR: In this paper, a branch-and-bound algorithm is proposed to solve the problem of n|m|P|Cmax problem with time lags, where p is the number of nodes in the n|1|seq dep|Ci problem.
Journal ArticleDOI
Job-Shop Scheduling by Implicit Enumeration
TL;DR: In this paper, a general bounding approach is developed which includes all previously presented lower bounds as special cases, and the strongest bound obtained in this way is combined with two enumeration schemes, the relative merits of which are discussed.