Job-Shop Scheduling with Multiple Orders per Job

摘要

This paper studies the job-shop scheduling problem with multiple orders per job. Both lot processing machines and item processing machines are discussed and thus two scheduling problems are proposed. The performance measure is the total weighted completion time of all orders. We present two different mixed binary integer programming (BIP) formulation methods for each proposed problem; one method is based on dichotomous restrictions and the other method adopts the concept of assignment problem. Thus, four mixed BIP models are developed to optimally solve the two scheduling problems. Different formulation methods are also compared with each other for each proposed problem on the same benchmark problem data set.