Single machine scheduling with forbidden start times

DOI10.1007/S10288-007-0061-5MaRDI QIDQ1022436zbMATH OpenOpenAlexFDO

Authors J.-C. 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)

Recommendations

• A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
• High-multiplicity scheduling on one machine with forbidden start and completion times
• Scheduling with forbidden sets
• The single-processor scheduling problem with time restrictions: complexity and related problems

Cites work

• 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
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Machine scheduling with an availability constraint
• New single machine and job-shop scheduling problems with availability constraints
• On the complexity of scheduling tasks with discrete starting times
• Optimal parallel machines scheduling with availability constraints
• Two-machine flowshop scheduling with availability constraints

Cited in

(11)

• 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
• Single machine unbounded parallel-batch scheduling with forbidden intervals
• Single machine scheduling with small operator-non-availability periods
• Off-line scheduling with forbidden zones
• High-multiplicity scheduling on one machine with forbidden start and completion times
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
• On-line scheduling with forbidden zones
• Scheduling with forbidden sets
• Two-agent single machine scheduling with forbidden intervals

Describes a project that uses

Uses Software

• ILOG SCHEDULE

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

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