Article contents
Scheduling jobs in open shopswith limited machine availability
Published online by Cambridge University Press: 15 December 2002
Abstract
In this paper, open shop scheduling problems with limited machine availabilityare studied. Such a limited availability of machines may appear inmany real-life situations, e.g. as preventive maintenance activities.Three types of jobs are distinguished: non-preemptable,resumable and preemptable. An operation of a resumable job if not completedbefore a non-availability period of a machine may be suspended and continuedwithout additional cost when the machine becomes available.In the paper, results are given for the scheduling problems associated withthe three types of jobs.Forpreemptable jobs polynomial-time algorithms based on the two-phase methodare proposed.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2002
References
- 2
- Cited by