A Performance Analysis of Tabu Search for Discrete-Continuous Scheduling Problems
Problems of scheduling jobs on parallel, identical machines under an additional continuous resource are considered. Jobs are non-preemptable and independent, and all are available at the start of the process. The total amount of the continuous resource available at a time is limited, and the resource is a renewable one. Each job simultaneously requires for its processing a machine and an amount (unknown in advance) of the continuous resource. The processing rate of a job depends on the amount of the resource allotted to this job at a time. Three scheduling criteria are considered: the makespan, the mean flow time, and the maximum lateness. The problem is to find a sequence of jobs on machines and, simultaneously, a continuous resource allocation that minimize the given criterion. A tabu search metaheuristic is presented to solve the problem. A computational analysis of the tabu search algorithm for the considered discrete-continuous scheduling problems is presented and discussed. Three different tabu list management methods are tested: the tabu navigation method, the cancellation sequence method, and the reverse elimination method.
KeywordsDiscrete-continuous scheduling problems Makespan Mean flow time Maximum lateness Tabu search Tabu navigation method Cancellation sequence method Reverse elimination method.
Unable to display preview. Download preview PDF.
- W.N. Burkow. Raspriedielenije riesursow kak zadacza optimalnogo bystrodiejstwia. Avtomat. I Tielemieh., 27 (7), 1966.Google Scholar
- J. J6zefowska, M. Mika, R. R6zycki, G. Walig6ra, and J. Wgglarz. Discrete-continuous scheduling to minimize maximum lateness. In Proc. of the Fourth International Symposium on Methods and Models in Automation and Robotics MMAR’97, Migdzyzdroje 26–29.08.1997, pages 947–952, 1997a.Google Scholar
- J. J6zefowska, M. Mika, R. R6zycki, G. Walig6ra, and J. Wgglarz. Discrete continuous scheduling to minimize the mean flow time–computational experiments. Computational Methods in Science and Technology, 3: 25–37, 1997b.Google Scholar
- J. Józefowska, G. Waligóra, and J. Wgglarz. Tabu search algorithm for some discrete-continuous scheduling problems. In Modern Heuristic Search Methods, pages 169–182. V.J. Rayward-Smith (ed.), Wiley, Chichester, 1996.Google Scholar
- J. Józefowska, G. Waligóra, and J. Wgglarz. Tabu search with the cancellation sequence method for a class of discrete-continuous scheduling problems. In Proc. of the Fifth International Symposium on Methods and Models in Automation and Robotics MMAR’98, Migdzyzdroje 25–29.08.1998, pages 1047–1052, 1998b.Google Scholar
- C. Lawrence, J.L. Zhou, and A.L. Tits. Users guide for CFSQP Version 2.3 (Released August 1995), 1995.Google Scholar