The economic lot scheduling problem under power-of-two policy

Ming-Jong Yao*, S. E. Elmaghraby

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Scopus citations


We present further analysis on the economic lot scheduling problem (ELSP) without capacity constraints under power-of-two (PoT) policy. We explore its optimality structure and discover that the optimal objective value is piece-wise convex. By making use of the junction points of this function, we derive an effective (polynomial-time) search algorithm to secure a global optimal solution. The conclusions of this research lay the foundation for deriving an efficient heuristic, and also creates a benchmark for evaluating the quality of the heuristics for the conventional ELSP under PoT policy.

Original languageEnglish
Pages (from-to)1379-1393
Number of pages15
JournalComputers and Mathematics with Applications
Issue number10-11
StatePublished - 1 May 2001


  • Global optimum
  • Inventory
  • Power-of-two policy
  • Scheduling
  • Search algorithm

Fingerprint Dive into the research topics of 'The economic lot scheduling problem under power-of-two policy'. Together they form a unique fingerprint.

Cite this