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

Computers and Operations Research

Volumn 34, Issue 7, 2007, Pages 2025-2042

  Pedersen, C R ^a   Rasmussen, R V ^a   Andersen, K A ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Elastic jobs; Large scale scheduling; Practical application; Precedence constraints; Tabu search

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING; SERVERS;

ELASTIC JOBS; LARGE SCALE SCHEDULING; PRACTICAL APPLICATION; PRECEDENCE CONSTRAINTS; TABU SEARCH;

CONSTRAINT THEORY;

EID: 33845341058     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.08.001     Document Type: Article

References (15)

1. Jain V., and Grossmann I.E. Algorithms for hybrid MILP, CP models for a class of optimization problems. INFORMS Journal on Computing 13 4 (2001) 258-276
2. Hooker J.N., and Ottosson G. Logic-based Benders decomposition. Mathematical Programming 96 (2003) 33-60
3. Hooker JN. Logic-based Benders methods for planning and scheduling. Lecture given at ISMP 2003.
4. Baptiste P., and Le Pape C. Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5 1-2 (2000) 119-139
5. Baptiste P., Le Pape C., and Nuijten W. Constraint-based scheduling: applying constraint programming to scheduling problems (2001), Kluwer Academic Publishers, Norwell, MA
6. Glover F. Tabu search-Part I. ORSA Journal on Computing 1 3 (1989) 190-206
7. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Norwell, MA
8. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers and Operations Research 31 11 (2004) 1891-1909
9. Ferland J.A., Ichoua S., Lavoie A., and Gagné E. Scheduling using tabu search methods with intensification and diversification. Computers and Operations Research 28 11 (2001) 1075-1092
10. Porto S.C.S., Kitajima J.P.F.W., and Ribeiro C.C. Performance evaluation of a parallel tabu search task scheduling problem. Parallel Computing 26 (2000) 73-90
11. Chekuri C., and Bender M. An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms 41 (2001) 212-224
12. Mansini R., Speranza M.G., and Tuza Z. Scheduling groups of tasks with precedence constraints on three dedicated processors. Discrete Applied Mathematics 134 (2004) 141-168
13. Chiang W.-C., and Russell R.A. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing 9 4 (1997) 417-430
14. Garey M.R., and Johnson D.S. Computers and intractability. a guide to the theory of NP-completeness (1979), W.H. Freeman and Company, New York
15. ILOG, ILOG Optimization Suite-white paper 2001. http://www.ilog.com.