Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration


COMPUTERS & OPERATIONS RESEARCH, vol.36, no.8, pp.2394-2417, 2009 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 36 Issue: 8
  • Publication Date: 2009
  • Doi Number: 10.1016/j.cor.2008.09.012
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.2394-2417
  • Keywords: Parallel machine, Earliness/tardiness, Learning effect, Deterioration effects, Common due-date, TOTAL COMPLETION-TIME, SINGLE-MACHINE, FLOW-SHOP, TARDINESS PENALTIES, PROCESSING TIMES, SHAPED POLICIES, DUE-DATE, EARLINESS, JOBS, ALLOCATION
  • Gazi University Affiliated: Yes


This paper considers a parallel machine earliness/tardiness (ET) scheduling problem with different penalties under the effects of position based learning and linear and nonlinear deterioration. The problem has common due-date for all jobs, and effects of learning and deterioration are considered simultaneously. By the effects of learning we mean that the job processing time decreases along the sequence of partly similar jobs, and by the effects of deterioration we mean slowing performance or time increases along the sequence of jobs. This study shows that optimal solution for ET scheduling problem under effects of learning and deterioration is V-shape schedule under certain agreeable conditions. Furthermore, we design a mathematical model for the problem under study and algorithm and lower bound procedure to solve larger test problems. The algorithm can solve problems of 1000 jobs and four machines within 3 s on average. The performance of the algorithm is evaluated using results of the mathematical model. (c) 2008 Elsevier Ltd. All rights reserved.