On single-machine scheduling without intermediate delays

DOI10.1016/j.dam.2008.03.010zbMath1152.90436MaRDI QIDQ955319

Philippe Chrétienne

Publication date: 19 November 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.010

zbMATH Keywords

complexity; algorithm; scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

On scheduling with the non-idling constraint, On scheduling with the non-idling constraint, Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times, A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines, Scheduling a single machine with primary and secondary objectives, A greedy approximation algorithm for minimum-gap scheduling, Single-machine scheduling with no idle time and release dates to~minimize a regular criterion, Homogeneously non-idling schedules of unit-time jobs on identical parallel machines, No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines

Cites Work

• Complexity results for scheduling chains on a single machine
• The one-machine sequencing problem
• Scheduling equal-length jobs on identical parallel machines
• An exact approach to early/tardy scheduling with release dates
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times