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

DOI10.1007/s10951-010-0185-xzbMath1280.90053OpenAlexW2075214065MaRDI QIDQ2434281

Antoine Jouglet

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0185-x

zbMATH Keywords

single machinerelease datesconstraint programmingregular criterianon-idling scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines, Homogeneously non-idling schedules of unit-time jobs on identical parallel machines, Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness, On scheduling with the non-idling constraint, A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines, On scheduling with the non-idling constraint

Cites Work

• On single-machine scheduling without intermediate delays
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• Accelerating filtering techniques for numeric CSPs
• An exact approach to early/tardy scheduling with release dates
• Dominance-based heuristics for one-machine total cost scheduling problems
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• On Scheduling with Ready Times to Minimize Mean Flow Time
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• On n/1/?? dynamic deterministic problems
• Ordonnancements à contraintes disjonctives
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
• Recent Advances in Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item