On the Solution Region for Certain Scheduling Problems with Preemption

  • 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.

Export metadata

Additional Services

Search Google Scholar
Author:Heidemarie Bräsel, Natalia Shakhlevich
Serie (Series number):Preprints (rote Reihe) des Fachbereich Mathematik (271)
Document Type:Report
Language of publication:English
Publication Date:2017/10/13
Year of Publication:1996
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/10/13
Number of page:19
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)