Job lateness in flowshops with setup and removal times separated
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.49, sa.9, ss.1001-1006, 1998 (SCI-Expanded, SSCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 49 Sayı: 9
- Basım Tarihi: 1998
- Doi Numarası: 10.1057/palgrave.jors.2600583
- Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
- Sayfa Sayıları: ss.1001-1006
- Anahtar Kelimeler: Maximum lateness, Ordered flowshop, Removal time, Setup time, Two-machine flowshop
- Gazi Üniversitesi Adresli: Hayır
Özet
This paper addresses the two-machine flowshop problem where the setup, processing, and removal times of the jobs are separated and are independent of the job sequence. This problem is considered with maximum lateness as a measure of performance. Elimination criteria are established for both the classical and ordered flowshops, and optimal sequences are obtained for special ordered flowshops.