Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

Authors:
C. R. Pedersen;R. V. Rasmussen;K. A. Andersen
Affiliations:
Department of Operations Research, University of Aarhus, Ny Munkegade, Building 530, 8000 Aarhus C, Denmark;Department of Operations Research, University of Aarhus, Ny Munkegade, Building 530, 8000 Aarhus C, Denmark;Department of Accounting, Finance and Logistics, Aarhus School of Business, Fuglesangs Allé 4, 8210 Aarhus V, Denmark
Venue:
Computers and Operations Research
Year:
2007

Citing 10
Cited 1

Performance evaluation of a parallel tabu search task scheduling algorithm

Parallel Computing - High performance computing in operations research
An efficient approximation algorithm for minimizing makespan on uniformly related machines

Journal of Algorithms
Scheduling using tabu search methods with intensification and diversification

Computers and Operations Research
Tabu Search

Tabu Search
Constraint-Based Scheduling

Constraint-Based Scheduling
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Constraint Propagation and Decomposition Techniques forHighly Disjunctive and Highly Cumulative Project Scheduling Problems

Constraints
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing
Scheduling groups of tasks with precedence constraints on three dedicated processors

Discrete Applied Mathematics
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research

Minimizing makespan for multi-spindle head machines with a mobile table

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a solution method for minimizing makespan of a practical large-scale scheduling problem with elastic jobs. The jobs are processed on three servers and restricted by precedence constraints, time windows and capacity limitations. We derive a new method for approximating the server exploitation of the elastic jobs and solve the problem using a tabu search procedure. Finding an initial feasible solution is in general NP-complete, but the tabu search procedure includes a specialized heuristic for solving this problem. The solution method has proven to be very efficient and leads to a significant decrease in makespan compared to the strategy currently implemented.