Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation

Problems of scheduling non-preemptable, independent jobs on parallel identical machines under an additional continuous renewable resource to minimize the makespan are considered. 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. The problem is to find a sequence of jobs on machines and, simultaneously, a continuous resource allocation that minimize the makespan. A heuristic procedure for allocating the continuous resource is used. The tabu search metaheuristic to solve the considered problem is presented. The results produced by tabu search are compared with optimal solutions for small instances, as well as with the results generated by simple search methods - multi-start iterative improvement and random sampling for larger instances.

[1]  Grzegorz Waligóra,et al.  A performance analysis of tabu search for discrete-continuous scheduling problems , 2004 .

[2]  Grzegorz Waligóra,et al.  A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan , 2002 .

[3]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[4]  Grzegorz Waligóra,et al.  Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs , 1999, Discret. Appl. Math..

[5]  Grzegorz Waligóra,et al.  Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows , 2011, 2011 16th International Conference on Methods & Models in Automation & Robotics.

[6]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[7]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[8]  Grzegorz Waligóra,et al.  Tabu list management methods for a discrete-continuous scheduling problem , 2002, Eur. J. Oper. Res..

[9]  Jan Węglarz,et al.  On a methodology for discrete-continuous scheduling , 1998, Eur. J. Oper. Res..

[10]  Jorge Pinho de Sousa,et al.  Metaheuristics: Computer Decision-Making , 2010 .

[11]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[12]  Grzegorz Waligóra,et al.  Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems , 2004 .

[13]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .