A Scheduling Problem on a Single Batching Machine with Batch Deliveries
In this paper,we address a coordination problem of single batching machine scheduling and finished jobs delivery where the jobs are processed on a single batching machine and delivered by a transporter to the customer. The batching machine can handle several jobs simultaneously. The processing time of a batch is equal to the longest processing time among the jobs in a batch. For the objective to minimize the makespan,we present a polynomial-time algorithm based on optimal properties. For the objective to minimize the total weighted completion time,we prove that this problem is strongly NP-hard.
GONG Hua TANG Lixin
College of Science,Shenyang Ligong University,Shenyang 100159,P.R.China Liaoning Key Laboratory of M Liaoning Key Laboratory of Manufacturing System and Logistics,the Logistics Institute,Northeastern U
国际会议
The 30th Chinese Control Conference(第三十届中国控制会议)
烟台
英文
1-5
2011-07-01（万方平台首次上网日期，不代表论文的发表时间）