| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427331 | Information Processing Letters | 2014 | 5 Pages |
•We study a lot scheduling problem with orders which can be split.•The objective is to minimize the total completion time of all orders.•We show that this problem can be solved in polynomial time.
In a practical situation, a manufacturer receives different orders from its customers. Different orders may contain different quantities of the product. Therefore, the manufacturer has to decide how to group these orders into different lots based on the capacity of the lot processing machine (such as integrated circuit tester, heated container, etc.) and then decides the sequence of these lots. In this paper, we study a lot scheduling problem with orders which can be split. The objective is to minimize the total completion time of all orders. We show that this problem can be solved in polynomial time.
