A review of scheduling research involving setup considerations

Allahverdi A., Gupta J. N., Aldowaisan T.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, sa.2, ss.219-239, 1999 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Derleme
  • Basım Tarihi: 1999
  • Doi Numarası: 10.1016/s0305-0483(98)00042-5
  • Dergi Adı: OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.219-239
  • Anahtar Kelimeler: Machine and shop scheduling, Review of problems and algorithms, Setup cost, Setup times
  • Gazi Üniversitesi Adresli: Hayır

Özet

The majority of scheduling research assumes setup as negligible or part of the processing time. While this assumption simplifies the analysis and/or reflects certain applications, it adversely affects the solution quality for many applications which require explicit treatment of setup. Such applications, coupled with the emergence of production concepts like time-based competition and group technology, have motivated increasing interest to include setup considerations in scheduling problems. This paper provides a comprehensive review of the literature on scheduling problems involving setup times (costs). It classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops. The suggested classification scheme organizes the scheduling literature involving setup considerations, summarizes the current research results for different problem types, and finally provides guidelines for future research. (C) 1999 Elsevier Science Ltd. All rights reserved.