A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties |
| |
Authors: | Jorge M.S. Valente,José Fernando Gonç alves |
| |
Affiliation: | LIAAD-INESC Porto L.A., Faculdade de Economia, Universidade do Porto, Rua Dr. Roberto Frias, 4200-464 Porto, Portugal |
| |
Abstract: | In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet. Several genetic algorithms based on this approach are presented. These versions differ on the generation of the initial population, as well as on the use of local search. The proposed procedures are compared with existing heuristics, as well as with optimal solutions for the smaller instance sizes. |
| |
Keywords: | Scheduling Single machine Linear earliness Quadratic tardiness Genetic algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|