Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence

✍ Scribed by Fatima Ghedjati

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 360 KB
• Volume: 37
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/s0360-8352(99)00019-4

✦ Synopsis

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 (Cmax). 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.