J. Blazewicz, P. Formanowicz, M. Kasprzak,
"Scheduling resumable jobs in two-machine flow shop system with limited
machine availability - a constraint programming approach",
Proceedings of the II Workshop on Constraint Programming for Decision
and Control CPDC'2000, Gliwice 2000, pp. 17-20.
Abstract:
The scheduling problem studied in this paper is concerned with the two-machine
flow shop with limited machine availability. The limited availability may be
due to preschedules, preventive maintenance, or overlap of two consecutive
time horizons in the rolling time horizon planning algorithm. This problem
is one of a great practical importance. Since it is NP-hard in the strong sense,
it is necessary to search for efficient methods which find good suboptimal
solutions. In the paper, mathematical programming formulation of the problem
is provided and it is used to model the problem in the ILOG system.
Suboptimal solutions obtained using ILOG are compared with optimal ones
provided by a branch and bound algorithm.
Back to the List of publications
19 Jul 2000