-
Same authors
- PubMed -
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
|||||||||||||||
RAIRO Oper. Res. 36 (2002) 149-156
DOI: 10.1051/ro:2002008
Scheduling jobs in open shops with limited machine availability
Jacek Blazewicz and Piotr FormanowiczInstitute of Computing Science, Poznan University of Technology, Piotrowo 3A, 60-965 Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Poznan, Poland; Piotr.Formanowicz@cs.put.poznan.pl.
(Received November, 2000.)
Abstract
In this paper, open shop scheduling problems with limited machine availability
are studied. Such a limited availability of machines may appear in
many 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 completed
before a non-availability period of a machine may be suspended and continued
without additional cost when the machine becomes available.
In the paper, results are given for the scheduling problems associated with
the three types of jobs.
For
preemptable jobs polynomial-time algorithms based on the two-phase method
are proposed.
Key words: Limited machine availability, computational complexity, two-phase method, mathematical programming.
© EDP Sciences 2002
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook