Properties of optimal schedules in preemptive shop scheduling

Authors:
Ph. Baptiste;J. Carlier;A. Kononov;M. Queyranne;S. Sevastyanov;M. Sviridenko
Affiliations:
CNRS, Heudiasyc, Univ. de Tech. de Compiègne, France and CNRS, Heudiasyc, ícole Polytechnique, France;CNRS, Heudiasyc, Univ. de Tech. de Compiègne, France;Sobolev Institute of Mathematics, Novosibirsk, Russia;Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, B.C., Canada V6T 1Z2;Sobolev Institute of Mathematics, Novosibirsk, Russia;IBM T.J. Watson Research Center, Yorktown Heights, USA
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 6
Cited 2

Minimizing mean flow time in two-machine open shops and flow shops

Journal of Algorithms
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

Journal of Algorithms
A Note on Open Shop Preemptive Schedules

IEEE Transactions on Computers
On preemption redundancy in scheduling unit processing time jobs on two parallel machines

Operations Research Letters
How useful are preemptive schedules?

Operations Research Letters

A Complete 4-parametric complexity classification of short shop scheduling problems

Journal of Scheduling
An optimal method for the preemptive job shop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems.