The economic lot scheduling problem under power-of-two policy
β Scribed by Ming-Jong Yao; S.E. Elmaghraby
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 870 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
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. (~) 2001 Elsevier Science Ltd. All rights reserved.
π SIMILAR VOLUMES