Single machine scheduling with forbidden start times

DOI10.1007/s10288-007-0061-5zbMath1162.90444OpenAlexW1978278096MaRDI QIDQ1022436

Jean-Charles Billaut, Francis Sourd

Publication date: 22 June 2009

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

Full work available at URL: https://doi.org/10.1007/s10288-007-0061-5

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (5)

High-multiplicity scheduling on one machine with forbidden start and completion times ⋮ Single machine scheduling with small operator-non-availability periods ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times ⋮ Approximate and robust bounded job start scheduling for Royal Mail delivery offices

Uses Software

• ILOG SCHEDULE

Cites Work

• Unnamed Item
• New single machine and job-shop scheduling problems with availability constraints
• On the complexity of scheduling tasks with discrete starting times
• Two-machine flowshop scheduling with availability constraints
• Optimal parallel machines scheduling with availability constraints
• Machine scheduling with an availability constraint
• A framework for the complexity of high-multiplicity scheduling problems
• Complexity results for scheduling tasks with discrete starting times
• Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times

This page was built for publication: Single machine scheduling with forbidden start times