Theoretical Paper

Journal of the Operational Research Society (2004) 55, 504–512. doi:10.1057/palgrave.jors.2601716

Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach

F Sivrikaya s cedilerifog brevelu1 and G Ulusoy2

  1. 1Abant Izzet Baysal University, Bolu, Turkey
  2. 2Sabanci University, Istanbul, Turkey

Correspondence: F Sivrikaya S cedilerifog brevelu, Department of Management, Abant Izzet Baysal University, Bolu, Turkey. E-mail: serifoglu_f@ibu.edu.tr

Received November 2002; Accepted December 2003.

Top

Abstract

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-hfsp.

Keywords:

multiprocessor tasks, hybrid flow-shops, make-span minimization, genetic algorithms

Extra navigation

.

Society resources

ADVERTISEMENT
JORS-Link to full archive