Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663969 | European Journal of Operational Research | 2005 | 13 Pages |
Abstract
We present local search algorithms for this problem where appropriate neighborhood structures are defined using problem-specific properties. An one-stage procedure is compared with a two-stage approach and a combination of both. Computational results are presented for test data arising from job-shop benchmark instances enlarged by transportation and empty moving times.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Johann Hurink, Sigrid Knust,