High Multiplicity in Earliness-Tardiness Scheduling

DOI10.1287/OPRE.48.5.788.12405zbMATH Open1106.90330OpenAlexW2098734690MaRDI QIDQ4530664FDOQ4530664

Authors: John J. Clifford, Marc E. Posner 

Publication date: 4 June 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.48.5.788.12405

Recommendations

• Parallel machine scheduling with high multiplicity
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Single machine earliness and tardiness scheduling
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• On polynomial solvability of the high multiplicity total weighted tardiness problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cited In (7)

• A polynomial algorithm for lot-size scheduling of two type tasks.
• A framework for the complexity of high-multiplicity scheduling problems
• An alternative approach for proving the NP-hardness of optimization problems
• Multiplicity and complexity issues in contemporary production scheduling
• Parallel machine scheduling with high multiplicity
• Cyclic lot-sizing problems with sequencing costs
• Scheduling with periodic availability constraints and irregular cost functions

This page was built for publication: High Multiplicity in Earliness-Tardiness Scheduling

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