We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the travelling-salesman problem with time windows, where additionally generalized precedence constraints have to be respected. The objective is to determine a sequence of all nodes and corresponding starting times in the given time windows in such a way that all generalized precedence relations are respected and the sum of all travelling and waiting times is minimized. We present a local search algorithm for this problem where an appropriate neighborhood structure is defined using problem-specific properties. In order to make the search process more efficient, we apply some techniques which accelerate the evaluation of the solutions in the proposed neighbourhood considerably. Computational results are presented for test data arising from job-shop instances with a single transport robot.
Original language | English |
---|
Place of Publication | Enschede |
---|
Publisher | University of Twente |
---|
Number of pages | 26 |
---|
Publication status | Published - 1999 |
---|
Name | Memorandum |
---|
Publisher | Department of Applied Mathematics, University of Twente |
---|
No. | 1496 |
---|
ISSN (Print) | 0169-2690 |
---|