The tricriteria flowshop scheduling problem

EREN T., GÜNER E.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, cilt.36, ss.1210-1220, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 36
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1007/s00170-007-0931-1
  • Dergi Adı: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1210-1220
  • Anahtar Kelimeler: flowshop scheduling, tricriteria, integer programming, heuristic methods, 2-MACHINE FLOWSHOP, TOTAL TARDINESS, INDEPENDENT SETUP, BOUND APPROACH, REMOVAL TIMES, ALGORITHM, BICRITERIA, BRANCH, MACHINE, SHOP
  • Gazi Üniversitesi Adresli: Evet

Özet

Multicriteria flowshop scheduling problems have been one of the most attractive subjects in recent years. In the multicriteria flowshop scheduling literature, a very limited number of studies have been performed on problems which include a tardiness criterion. In this paper a multicriteria (tricriteria) two-machine flowshop scheduling problem with a tardiness criterion is tackled. The objective is to minimise a weighted sum of total completion time, total tardiness and makespan. An integer programming model is proposed for the problem which belongs to NP-hard class. The modified NEH (Nawaz, Enscore and Ham) algorithm, a tabu search-based heuristic method, random search and the EDD rule (the earliest due date rule) are used to solve problems with up to 2,500 jobs. A computational analysis is conducted to evaluate the performance of the heuristics. The analysis shows that the heuristics are quite efficient, and the performance of the tabu search based heuristic is the best of all in terms of solution quality.