On single-machine scheduling without intermediate delays - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2008

On single-machine scheduling without intermediate delays

Philippe Chrétienne
  • Function : Author
  • PersonId : 968920

Abstract

This paper introduces the non-idling machine constraint where no intermediate idle time between the operations processed by a machine is allowed. In its first part, the paper considers the non-idling single-machine scheduling problem. Complexity aspects are first discussed. The “Earliest Non-Idling” property is then introduced as a sufficient condition so that an algorithm solving the original problem also solves its non-idling variant. Moreover it is shown that preemptive problems do have that property. The critical times of an instance are then introduced and it is shown that when their number is polynomial, as for equal-length jobs, a polynomial algorithm solving the original problem has a polynomial variant solving its non-idling version.

Dates and versions

hal-01185151 , version 1 (19-08-2015)

Identifiers

Cite

Philippe Chrétienne. On single-machine scheduling without intermediate delays. Discrete Applied Mathematics, 2008, 156 (13), pp.2543-2550. ⟨10.1016/j.dam.2008.03.010⟩. ⟨hal-01185151⟩
71 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More