An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions

DOI10.1016/0895-7177(89)90321-XzbMath0702.90033OpenAlexW1973612821MaRDI QIDQ915629

Elsie Sterbin Gottlieb

Publication date: 1989

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(89)90321-x

zbMATH Keywords

production systemheuristicLagrangian decompositionnetwork subproblemsseveral time periods

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Generalized upper bounding techniques
• The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions
• An Efficient Algorithm for Multi-Item Scheduling