Sciweavers

ACTA
1998

Machine Scheduling with Availability Constraints

13 years 3 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems and analyze their complexity. We survey NP-hardness results, polynomial optimization and approximation algorithms. We also distinguish between on-line and off-line formulations of the problems. Results are concerned with criteria on completion times and due dates.
Eric Sanlaville, Günter Schmidt
Added 21 Dec 2010
Updated 21 Dec 2010
Type Journal
Year 1998
Where ACTA
Authors Eric Sanlaville, Günter Schmidt
Comments (0)