Testing Feasibility in a Lot Scheduling Problem

DOI10.1287/OPRE.38.6.1079MaRDI QIDQ5202003zbMATH OpenOpenAlexFDO

Authors Edward J. Anderson

Publication date 1990

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

NP-hardeffective heuristicEconomic Lot Scheduling

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Inventory, storage, reservoirs (90B05) Production models (90B30)

Recommendations

• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• Feasibility of Scheduling Lot Sizes of Three Products on One Machine
• Feasibility of scheduling lot sizes of two frequencies on one machine
• Two heuristics for the economic lot scheduling problem: An experimental study
• Multilevel capacitated lotsizing complexity and LP-based heuristics

Cited in

(6)

• Analysis of the feasible domain of ELSP problems based on hybrid algorithms
• On the economic lot scheduling problem with backlogging: The common cycle approach
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• Towards real-time automated stowage planning -- optimizing constraint test ordering
• How to avoid stockouts when producing several items on a single facility? What to do if you can't?
• Feasibility of Scheduling Lot Sizes of Three Products on One Machine

This page was built for publication: Testing Feasibility in a Lot Scheduling Problem

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