Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: heuristic mixing method machines and precedence
In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (C-max) We propose an original resolution method based on genetic algorithms and that we call heuristic mixing method, where crossovers merge the specific heuristics designed for the considered problem. After a description of both the problem and the resolution method, we present the experimental results. (C) 1999 Elsevier Science Ltd. All rights reserved.
genetic algorithms job-shop scheduling heuristic mixing method unrelated parallel machines linear and non-linear process routings