Operator non-availability periods

DOI10.1007/s10288-008-0084-6zbMath1176.90194OpenAlexW1997332430MaRDI QIDQ1041405

Vitaly A. Strusevich, Christophe Rapine, Chris N. Potts, Nadia Brauner, Hans Kellerer, Vassilissa Lehoux-Lebacque, Gerd Finke

Publication date: 2 December 2009

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

Full work available at URL: https://doi.org/10.1007/s10288-008-0084-6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

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 ⋮ 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 ⋮ Single machine scheduling with small operator-non-availability periods ⋮ Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time ⋮ Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time ⋮ 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

• Unnamed Item
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• Parallel machine scheduling with a common server
• Complexity results for parallel machine problems with a single server
• Machine scheduling with an availability constraint