Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
479038 | European Journal of Operational Research | 2007 | 15 Pages |
Abstract
This paper deals with the problem of scheduling jobs in uniform parallel machines with sequence-dependent setup times in order to minimize the total tardiness relative to job due dates. We propose GRASP versions that incorporate adaptive memory principles for solving this problem. Long-term memory is used in the construction of an initial solution and in a post-optimization procedure which connects high quality local optima by means of path relinking. Computational tests are carried out on a set of benchmark instances and the proposed GRASP versions are compared with heuristic methods from the literature.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Vinícius Amaral Armentano, Moacir Felizardo de França Filho,