会议专题

Single-machine scheduling problems with decreasing linear deterioration and learning effects

This paper considers a scheduling model with decreasing linear deterioration and learning effects 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 jobs scheduled position in the sequence. It shows that the optimal schedule for the single-machine scheduling problem to minimize makespan and total complete time under the proposed model can be solved in polynomial time. It further shows that the problem to minimize the total lateness has polynomial-time solution under some agreeable conditions.

Single machine Deterioration Learning effects

Xiaokun Huang Sian Xiong Yunqiang Yin

Department of Mathematics Honghe University Mengzi., Yunnan, China, 661100 School of Mathematics and Information Sciences East China Institute of Technology Fuzhou, Jiangxi 34

国际会议

The Fourth International Joint Conference on Computational Science and Optimization(第四届计算科学与优化国际大会 CSO 2011)

昆明、丽江

英文

370-373

2011-04-15(万方平台首次上网日期,不代表论文的发表时间)