The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

DOI10.1287/mnsc.28.7.798zbMath0482.90022OpenAlexW2121917041MaRDI QIDQ3941152

Fayez F. Boctor

Publication date: 1982

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.28.7.798

zbMATH Keywords

optimal solution algorithmN-product schedulesnecessary and sufficient feasibility conditionstwo-product, single-machine, static demand, infinite horizon lot scheduling

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (10)

A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes ⋮ Constrained Optimal Production Lot Sizes for Several Products ⋮ A note on linear programming and the single machine lot size scheduling problem ⋮ The G-group heuristic for single machine lot scheduling ⋮ On the economic lot scheduling problem with backlogging: The common cycle approach ⋮ Multi-stage production/inventory deterministic lot size computations ⋮ Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand ⋮ Cyclic lot-sizing problems with sequencing costs ⋮ A hybrid heuristic and linear programming approach to multi-product machine scheduling ⋮ Multiproduct cycling with packaging in the process industry

This page was built for publication: The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem