A Lot Scheduling Problem on a Single Machine 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 use a binary integer programming approach to solve this problem. The binary integer programming approach with run time limit is considered as one heuristic method. As compared to a lower bound, it turns out the average performance of the method is really good.