Single machine scheduling with small operator-non-availability periods

DOI10.1007/s10951-012-0269-xzbMath1280.90065OpenAlexW2074059805MaRDI QIDQ2434272

Christophe Rapine, Gerd Finke, Vassilissa Lebacque, Nadia Brauner

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-012-0269-x

zbMATH Keywords

approximation algorithmsingle machine schedulingunavailability constraintsforbidden start and end

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (9)

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval ⋮ High-multiplicity scheduling on one machine with forbidden start and completion times ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ Single-machine scheduling with operator non-availability to minimize total weighted completion time ⋮ Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints ⋮ A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

Cites Work

• Single-machine scheduling with periodic maintenance to minimize makespan
• New single machine and job-shop scheduling problems with availability constraints
• Single machine scheduling with forbidden start times
• Operator non-availability periods
• Parallel machine scheduling with a common server
• Complexity results for parallel machine problems with a single server
• Scheduling with limited machine availability
• Machine scheduling with an availability constraint
• Bounds on Multiprocessing Timing Anomalies
• A note on an open-end bin packing problem

This page was built for publication: Single machine scheduling with small operator-non-availability periods