06-26

Algorithms for Flexible Flow Shop Problems with Unrelated Parallel Machines, Setup Times, and Dual Criteria

by Jungwattanakit, J.; Reodecha, M.; Chaovalitwongse, P.; Werner, F.

 

Preprint series: 06-26, Preprints

The paper is published: International Journal of Advanced Manufacturing Technology, Vol. 37, 2008, 354 - 370.

MSC:
90B35 Scheduling theory, See also {68M20}

 

Abstract: This paper considers the problem of scheduling n jobs in a flexible flow shop scheduling environment with unrelated parallel machines. For each job, a release and due date are given and both sequence- and machine-dependent setup times are considered. The problem is to determine a schedule that minimizes a convex combination of makespan and the number of tardy jobs. A 0-1 mixed integer program is formulated, and various heuristic algorithms are developed. First, a number of constructive algorithms are discussed, and then a genetic algorithm is presented and tested on problems with up to 50 jobs and 20 stages.

Keywords: Flexible Flow Shop Scheduling, Heuristics, Genetic Algorithms, Mathematical Programming


The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.

Letzte Änderung: 01.03.2018 - Ansprechpartner: Webmaster