Split scheduling with uniform setup times - Archive ouverte HAL Access content directly
Journal Articles Journal of Scheduling Year : 2015

Split scheduling with uniform setup times

(1) , (2) , (2) , (3, 4, 2) , (5) , (1)
1
2
3
4
5

Abstract

We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a machine cannot process or set up any other job. We concentrate on the basic case in which setup times are job-, machine- and sequence-independent. Problems of this kind were encountered when modelling practical problems in planning disaster relief operations. Our main algorithmic result is a polynomial-time algorithm for minimising total completion time on two parallel identical machines. We argue, why the same problem with three machines is not an easy extension of the two-machine case, leaving the complexity of this case as a tantalising open problem. We give a constant-factor approximation algorithm for the general case with any number of machines and a polynomial-time approximation scheme for a fixed number of machines. For the version with the objective to minimise total weighted completion time, we prove NP-hardness. Finally, we conclude with an overview of the state of the art for other split scheduling problems with job-, machine- and sequence-independent setup times.
Fichier principal
Vignette du fichier
SplitSchedulingJoS_rev2.pdf (337.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01249095 , version 1 (31-05-2017)

Identifiers

Cite

Frans Schalekamp, René Sitters, Suzanne van Der Ster, Leen Stougie, Víctor Verdugo, et al.. Split scheduling with uniform setup times. Journal of Scheduling, 2015, 18 (2), pp.119-129 ⟨10.1007/s10951-014-0370-4⟩. ⟨hal-01249095⟩
202 View
114 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More