A Simplified Enumeration Scheme for Minimizing Total Completion Time plus Total Penalty with Release Dates
In this paper, we consider the problem of scheduling jobs with release dates and rejection on a bounded single parallel batching machine.Our objective is to minimize the sum of total completion time of the accepted jobs and the total penalty of the rejected jobs.We need to determine how to choose jobs for processing, divide these jobs into batches, and sequence these batches so that the objective function is minimized.We give a simplified enumeration approximation scheme for this problem by applying combinatorial optimization techniques with delicate analysis.
Batch scheduling PTAS Release date Total penalty
Yong Zhang Haodi Feng Zheng Sun
School of Computer Science and Technology,Shandong University,Jinan 250101,China School of Computer Science and Technology,Shandong University of Technology,Zibo 255049,China
国内会议
金华
英文
1-10
2015-10-30(万方平台首次上网日期,不代表论文的发表时间)