Akademik Veri Yönetim Sistemi
International Journal of Agile Manufacturing, cilt.8, sa.2, ss.155-163, 2005 (Scopus)
A three-machine flowshop problem involves scheduling a number of three-operation jobs wherein the first, second, and third operations are performed on the first, second, and third machine, respectively. The common criteria considered in the literature can be classified as those involving job completion times such as makespan and those related to job due dates such as maximum lateness. For a three-machine flowshop, the literature reveals that, mainly, criteria related to job completion time have been addressed. In this paper, the three-machine flowshop problem is considered with respect to the maximum lateness criterion. Optimal solutions are obtained for three special flowshops. © 2005 IJAM.