Three-machine no-wait flowshop with separate setup and removal times to minimize total completion time
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, sa.2, ss.113-123, 2004 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Basım Tarihi: 2004
- Dergi Adı: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.113-123
- Gazi Üniversitesi Adresli: Hayır
Özet
The three-machine no-wait flowshop problem is addressed to minimize total completion time where setup and removal times of the jobs are considered as separate from processing times. Several heuristics are developed and computationally tested for effectiveness. Results of extensive computational experiments on randomly generated data show that the proposed heuristics perform quite well. Significance: Several Heuristics are proposed to efficiently solve the three-machine no-wait flowshop problem with separate setup and removal times and total completion time criterion. The proposed insertion based heuristics are suitable for real world applications.