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

In this paper, 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. Then, a binary integer programming approach and four simple heuristics are pr...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2017-03, Vol.79, p.34-38
Main Authors: Yang, Dar-Li, Hou, Yung-Tsung, Kuo, Wen-Hung
Format: Article
Language:English
Subjects:
Heuristic
Indivisible order
Integer programming
Job shops
Lot scheduling
Order processing
Scheduling algorithms
Single machine
Studies
Total completion time
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, 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. Then, a binary integer programming approach and four simple heuristics are proposed to solve the problem. The binary integer programming approach with running time limit is considered as one heuristic method. As compared to a lower bound, the average performances of the heuristic method are really good and better than those of the four simple heuristics. •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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2016.10.004