Scheduling with Agreeable Processing Times and Due Dates on a Semi-Continuous Batch Processing Machine
We consider a new kind of problems called semi-continuous batch scheduling. The processing time of each job in the same batch is equal to the basic processing time of the batch, the processing time of a batch is related to its size, the basic processing time and the capacity of the batching machine. In this paper, the job processing times and due dates are assumed to be agreeable. We consider two different objective functions: minimize the maximum tardiness and minimize the number of tardy jobs, two polynomial algorithms are proposed, respectively.
Yufang Zhao Lixin Tang
The Logistics Institute Northeastern University Shenyang, Liaoning, 110004
国际会议
南宁
英文
2007-07-20（万方平台首次上网日期，不代表论文的发表时间）