Multiprocessor task scheduling in multistage hyrid flowshops: a genetic algorithm approach

Warning The system is temporarily closed to updates for reporting purpose.

Sivrikaya Şerifoğlu, Funda and Ulusoy, Gündüz (2004) Multiprocessor task scheduling in multistage hyrid flowshops: a genetic algorithm approach. Journal of the Operational Research Society, 55 (5). pp. 504-512. ISSN 0160-5682

PDF (This is a RoMEO yellow journal -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1057/palgrave.jors.2601716


This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage. This problem is of practical interest in the textile and process industries. A genetic algorithm (GA) is developed to solve the problem. The GA is tested against a lower bound from the literature as well as against heuristic rules on a test bed comprising 400 problems with up to 100 jobs, 10 stages, and with up to five processors on each stage. For small problems, solutions found by the GA are compared to optimal solutions, which are obtained by total enumeration. For larger problems, optimum solutions are estimated by a statistical prediction technique. Computational results show that the GA is both effective and efficient for the current problem. Test problems are provided in a web site at www.benchmark.ibu.edu.tr/mpt-h; fsp.

Item Type:Article
Uncontrolled Keywords:multiprocessor tasks; hybrid flow-shops; make-span minimization; genetic algorithms
Subjects:T Technology > TS Manufactures
ID Code:348
Deposited By:Gündüz Ulusoy
Deposited On:20 Feb 2007 02:00
Last Modified:17 Sep 2019 16:47

Repository Staff Only: item control page