High-multiplicity scheduling on one machine with forbidden start and completion times

DOI10.1007/s10951-016-0475-zzbMath1353.90059OpenAlexW2331986476MaRDI QIDQ341471

Nadia Brauner, Christophe Rapine, Michaël Gabay

Publication date: 16 November 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0475-z

zbMATH Keywords

schedulingparameterized complexityavailability constraintshigh-multiplicity

Mathematics Subject Classification ID

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

Related Items (2)

Parameterized complexity of machine scheduling: 15 open problems ⋮ Approximate and robust bounded job start scheduling for Royal Mail delivery offices

Cites Work

• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• Single machine scheduling with forbidden start times
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• Operator non-availability periods
• A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
• Single machine scheduling with small operator-non-availability periods
• A framework for the complexity of high-multiplicity scheduling problems
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• Integer Programming with a Fixed Number of Variables
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Algorithms - ESA 2003
• Parallel machine scheduling with high multiplicity

This page was built for publication: High-multiplicity scheduling on one machine with forbidden start and completion times