A note on single-machine rescheduling problems with learning effect under disruptions
(0) Rescheduling problem means that a set of original jobs has already been scheduled to minimize some classical objective, then the decision maker needs to insert some new jobs into the existing schedule and creates a disruption. In this paper, we consider single-machine rescheduling problem with position-dependent learning effect under disruption, which learning effect means that the processing time of a job reflects a decreasing as a function of the number of repetitions. The objective is to minimize makepan, the total completion time and maximum lateness under a limit of the disruption from the original scheduling, and to minimize the total of the cost with original cost measure and disruption, respectively. We show that the considered problem can be solved in polynomial time.
rescheduling learning effect disruption makespan total completion time lateness.
Cheng Mingbao Zhang Bixi
School of Management,Guangdong University of Technology Guangzhou, PR.China
国际会议
成都
英文
378-382
2010-07-09（万方平台首次上网日期，不代表论文的发表时间）