Operator non-availability periods

DOI10.1007/S10288-008-0084-6MaRDI QIDQ1041405zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Single machine scheduling with small operator-non-availability periods
• Single machine scheduling with an operator non-availability period to minimize total completion time
• Single-machine scheduling with operator non-availability to minimize total weighted completion time
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
• Machine scheduling with availability constraints

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Complexity results for parallel machine problems with a single server
• Machine scheduling with an availability constraint
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• Parallel machine scheduling with a common server

Cited in

(10)

• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
• Single machine scheduling with small operator-non-availability periods
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• Single-machine scheduling with operator non-availability to minimize total weighted completion time
• 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 an operator non-availability period to minimize total completion time
• Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
• A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times

This page was built for publication: Operator non-availability periods

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