Preprints (rote Reihe) des Fachbereich Mathematik
Refine
Year of publication
- 1996 (1)
Document Type
- Report (1) (remove)
Language
- English (1)
Has Fulltext
- yes (1) (remove)
Faculty / Organisational entity
271
The paper deals with parallel-machine and open-shop scheduling problems with preemptions and arbitrary nondecreasing objective function. An approach to describe
the solution region for these problems and to reduce them to minimization problems on polytopes is proposed. Properties of the solution regions for certain problems are investigated. lt is proved that open-shop problems with unit processing times are equivalent to certain parallel-machine problems, where preemption is allowed at arbitrary time. A polynomial algorithm is presented transforming a schedule of one type into a schedule of the other type.