Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect

Isler M. C., TOKLU B., Celik V.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, cilt.61, ss.1129-1137, 2012 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 61
  • Basım Tarihi: 2012
  • Doi Numarası: 10.1007/s00170-011-3777-5
  • Dergi Adı: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1129-1137
  • Anahtar Kelimeler: Scheduling, Earliness and tardiness, Common due date, Flow-shop, Heuristics, COMMON DUE-DATE, TARDINESS PENALTIES, MINIMIZING EARLINESS, ABSOLUTE DEVIATION, COMPLETION TIMES, TABU SEARCH, MINIMIZATION, ALGORITHM
  • Gazi Üniversitesi Adresli: Evet

Özet

In the literature, earliness/tardiness (E/T) problem was known as weighted absolute deviation problem, and both tardiness and earliness is very important performance criteria for scheduling problem. While total tardiness criteria provides adaptation for due date (ignoring results of earliness done jobs), it deals with only cost of tardiness. However this phenomenon has been started to change with just-in-time (JIT) production concept. On JIT production, earliness is as important as tardiness. The phenomenon of the learning effect has been extensively studied in many different areas of operational research. However, there have been a few studies in the general context of production scheduling such as flow-shop scheduling. This paper addresses the minimization of the total earliness/tardiness penalties under learning effects in a two-machine flow-shop scheduling problem. Jobs have a common due date. We present mathematical model to obtain an optimal schedule for a given job sequence. We also present heuristics that use genetic algorithm and tabu search, based on proposed properties. Furthermore, random search was used for showing the significance of the study by comparison purpose. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. The experimental results show that the performance of proposed approach is quite well, especially for the instances of large size.