The economic lot scheduling problem under extended basic period and power-of-two policy

DOI10.1007/S11590-009-0154-5zbMath1189.90067OpenAlexW2023261881MaRDI QIDQ968005

Wikrom Jaruphongsa, Huei-Chuen Huang, Hainan Sun

Publication date: 3 May 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0154-5

zbMATH Keywords

heuristicELSPpower-of-twoparametric search algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• The economic lot scheduling problem: a pure genetic search approach
• The G-group heuristic for single machine lot scheduling
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• Two heuristics for the economic lot scheduling problem: An experimental study
• Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• The economic lot scheduling problem under power-of-two policy

This page was built for publication: The economic lot scheduling problem under extended basic period and power-of-two policy