On scheduling with the non-idling constraint

DOI10.1007/S10288-014-0257-4MaRDI QIDQ5895181zbMATH OpenOpenAlexFDO

Authors 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

algorithmcomplexitydeterministicnon-idling constraintscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On scheduling with the non-idling constraint
• On single-machine scheduling without intermediate delays
• 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
• A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines

Cites work

• 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
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• Complexity of Scheduling under Precedence Constraints
• Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• On single-machine scheduling without intermediate delays
• Optimal scheduling for two-processor systems
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion

Cited in

(12)

• On not-first/not-last conditions in disjunctive scheduling
• Surveys in operations research
• A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
• On non-preemptive scheduling of recurring tasks using inserted idle times
• No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
• 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
• Twelve surveys in operations research
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
• On scheduling with the non-idling constraint
• Still more surveys in operations research\dots
• On single-machine scheduling without intermediate delays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895181)