The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration

TOKSARI M. D., Guner E.

EXPERT SYSTEMS WITH APPLICATIONS, cilt.37, sa.1, ss.92-112, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 37 Sayı: 1
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1016/j.eswa.2009.05.014
  • Dergi Adı: EXPERT SYSTEMS WITH APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.92-112
  • Anahtar Kelimeler: Parallel machine, Earliness/tardiness, Learning effect, Deterioration effects, Common due-date, TOTAL COMPLETION-TIME, SINGLE-MACHINE, FLOW-SHOP, TARDINESS PENALTIES, PROCESSING TIMES, SHAPED POLICIES, JOBS, EARLINESS, EARLINESS/TARDINESS, MINIMIZE
  • Erciyes Üniversitesi Adresli: Evet

Özet

This paper considers earliness/tardiness (ET) scheduling problem on a parallel machine environment with common due-date under the effects of time-dependent learning and linear and nonlinear deterioration. In this paper, the effects of learning and deterioration are considered simultaneously. By the effects of learning and deterioration. we mean that the processing time of a job is defined by increasing function of its execution start time and position in the sequence. 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 present a mathematical model for the problem under study and an algorithm for solving large test problems. The algorithm can solve problems of 1000 jobs and four machines within 3 s on average. (C) 2009 Elsevier Ltd. All rights reserved.