Single-machine scheduling problems with general learning effects and deterioration jobs
This paper considers a scheduling model with general learning effects and deteriorating jobs simultaneously, where the actual processing time of a job is a function depends not only on the start time of the job, but also on the total normal processing times of jobs in front of it in the sequence. It shows that the optimal schedule for the singlemachine scheduling problem to minimize makespan is obtained by the longest processing time first (LPT) rule. For the problem to minimize total complete time, we use the smallest processing time first (SPT) rule as a heuristic algorithm and analyze its worstcase bound.
scheduUng learning effects deterioration jobs
Yunqiang Yin Hai Sun Zhousheng Ruan
School of Mathematics and Information Sciences East China Institute of Technology Fuzhou,Jiangxi 344000,China
国际会议
黄山
英文
186-189
2010-05-28（万方平台首次上网日期，不代表论文的发表时间）