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

DOI10.1007/S11590-009-0154-5zbMATH Open1189.90067OpenAlexW2023261881MaRDI QIDQ968005FDOQ968005

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

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

Cites Work

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

Cited In (2)

• The Economic Lot and Delivery Scheduling Problem: Powers of Two Policies
• The Economic Lot and Supply Scheduling Problem Under a Power-of-Two Policy

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

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