Job lateness in flowshops with setup and removal times separated

ALLAHVERDİ A., Aldowaisan T.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, sa.9, ss.1001-1006, 1998 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 1998
  • Doi Numarası: 10.1038/sj.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
  • 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.