On the solution region for certainscheduling problems with preemption

Heidemarie Bräsel and Natalia Shakhlevich

Annals of Operations Research, 1998, vol. 83, issue 0, 22 pages

Abstract: The paper deals with parallel machine and open shop scheduling problems with pre-emptions and an arbitrary nondecreasing objective function. An approach to describing the solution region for these problems and to reducing them to minimization over polytopes is proposed. Properties of the solution regions for certain problems are investigated. It is proved that open shop problems with unit processing times are equivalent to certain parallel machine problems, where preemption is allowed at arbitrary times. A polynomial algorithm is presented, transforming a schedule of one type into a schedule of the other type. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018999711765 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:83:y:1998:i:0:p:1-22:10.1023/a:1018999711765

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018999711765

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().