AN EXTENSION TO THE CLASS OF EASY ECONOMIC LOT SCHEDULING PROBLEMS

被引:18
作者
GALLEGO, G
机构
[1] Department of Industrial Engineering and Operations Research, Columbia University, New York
关键词
D O I
10.1080/07408179008964172
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We extend known conditions under which a rotation schedule is optimal in the Economic Lot Scheduling Problem by using a tighter lower bound that explicitly considers machine capacity. We also show how these results can be used when backorders are allowed. © 1990 Taylor & Francis Group, LLC.
引用
收藏
页码:189 / 190
页数:2
相关论文
共 1 条
[1]   WHEN IS THE ECONOMIC LOT SCHEDULING PROBLEM EASY [J].
JONES, PC ;
INMAN, RR .
IIE TRANSACTIONS, 1989, 21 (01) :11-20