摘要

The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. This note considers a single-machine scheduling problem with deteriorating jobs and learning effects. All of the jobs have a common (but unknown) due date. The objective is to minimize the sum of the weighted earliness, tardiness and due-date penalties. An O(n(3)) algorithm is proposed to optimally solve the problem with deteriorating jobs and job-dependent learning effect. Besides, an O(n log n) algorithm is provided to solve the problem with deteriorating jobs and job-independent learning effect. Journal of the Operational Research Society (2011) 62, 206-210. doi:10.1057/jors.2009.155 Published online 6 January 2010

  • 出版日期2011-1