On scheduling with the non-idling constraint

DOI10.1007/S10288-014-0257-4zbMath1297.90036OpenAlexW2070138302MaRDI QIDQ5895181

Philippe Chrétienne

Publication date: 18 September 2014

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01216495/file/Chretienne_2015_On_scheduling_with.pdf

zbMATH Keywords

complexityalgorithmschedulingdeterministicnon-idling constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Twelve surveys in operations research ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Surveys in operations research ⋮ On scheduling with the non-idling constraint ⋮ No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths

Cites Work

• Unnamed Item
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• On single-machine scheduling without intermediate delays
• A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
• An exact approach to early/tardy scheduling with release dates
• 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
• Optimal scheduling for two-processor systems
• Complexity of Scheduling under Precedence Constraints

This page was built for publication: On scheduling with the non-idling constraint