The economic lot scheduling problem without capacity constraints

DOI10.1007/s10479-004-5033-yzbMath1119.90024OpenAlexW2091379730MaRDI QIDQ1772974

Ming-Jong Yao

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-004-5033-y

zbMATH Keywords

productionschedulinginventorysearch algorithmlot sizing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (3)

An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy ⋮ A genetic algorithm for solving the economic lot scheduling problem in flow shops ⋮ Economic lot scheduling problems incorporating a cost of using the production facility

Cites Work

• Unnamed Item
• Scheduling Economic Lot Size Production Runs
• The G-group heuristic for single machine lot scheduling
• Two heuristics for the economic lot scheduling problem: An experimental study
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
• A Note on the Joint Replenishment Problem under Constant Demand
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• Scheduling a Multi-Product Single Machine System
• The economic lot scheduling problem under power-of-two policy

This page was built for publication: The economic lot scheduling problem without capacity constraints