On single-machine scheduling without intermediate delays

Authors:
Philippe Chrétienne
Affiliations:
Paris 6 University, LIP6 Laboratory, Bureau C513, 104 avenue du Président Kennedy, 75006 Paris, France
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 3
Cited 6

Scheduling equal-length jobs on identical parallel machines

Discrete Applied Mathematics
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
An exact approach to early/tardy scheduling with release dates

Computers and Operations Research

Exact resolution of the one-machine sequencing problem with no machine idle time

Computers and Industrial Engineering
Single-machine scheduling with no idle time and release dates to minimize a regular criterion

Journal of Scheduling
Polynomial-time algorithms for minimum energy scheduling

ACM Transactions on Algorithms (TALG)
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Computers and Operations Research
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines

Discrete Applied Mathematics
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

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.