Lot scheduling on a single machine
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.
lot scheduling scheduling single machine order total completion time