A note on a single-machine lot scheduling problem with indivisible orders

详细信息    查看全文

• 作者：Dar-Li Yang ; Yung-Tsung Hou ; Wen-Hung Kuo ; ^{whkuo@nfu.edu.tw}
• 关键词：Lot scheduling ; Single machine ; Total completion time ; Indivisible order ; Integer programming
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：79
• 期：Complete
• 页码：34-38
• 全文大小：275 K
• 卷排序：79

文摘

A lot scheduling problem on a single machine with indivisible orders is studied. The objective is to minimize the total completion time of all orders. We show that the problem is NP-hard in the strong sense. A binary integer programming approach with run time limit is proposed. As compared to a lower bound, the average performance of the method good.