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.
scheduling multiple orders per job job-shop integer programming
Jen-Shiang Chen
Graduate Institute of Global Trade and Logistics,Takming University of Science and Technology, Taiwan, China
国际会议
The Institute Industrial Engineera Asian Conference 2011(2011年国际工业工程师协会亚洲会议)
上海
英文
473-481
2011-06-10（万方平台首次上网日期，不代表论文的发表时间）