The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
DOI10.1287/opre.40.4.736zbMath0758.90039OpenAlexW2011014624MaRDI QIDQ4022930
Publication date: 17 January 1993
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.4.736
Lagrangian relaxationtraveling salesmanheuristic solution procedureminimum spanning treelot sizingsingle facilitysequence-dependent setup costscyclic lot scheduling
Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (14)
This page was built for publication: The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups