Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups

DOI10.1057/JORS.1995.65MaRDI QIDQ4838215zbMATH OpenOpenAlexFDO

Authors Khalil S. Hindi

Publication date 24 July 1995

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1995.65

zbMATH Keywords

capacitated transshipment problemminimum-cost network flowmulti-item lot-sizingproduction planning

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10) Production models (90B30)

Recommendations

• An effective algorithm for the capacitated single item lot size problem
• An optimal algorithm for the multi-item capacitated production planning problem
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review

Cited in

(20)

• Multi-item lot-sizing with joint set-up costs
• A hybrid heuristic and linear programming approach to multi-product machine scheduling
• Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories
• Discrete multi-module capacitated lot-sizing problems with multiple items
• Algorithms for the two-stage production-capacitated lot-sizing problem
• Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
• A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
• Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
• The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
• A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Constant approximation algorithm for non-uniform capacitated multi-item lot-sizing via strong covering inequalities
• A Lot-Sizing Problem on Trees, Related to Network Design
• Modeling industrial lot sizing problems: a review
• Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
• An optimal algorithm for the multi-item capacitated production planning problem
• Capacitated lot-sizing with extensions: a review

Describes a project that uses

Uses Software

• RELAX4

This page was built for publication: Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups

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