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

被引：6
|
作者：
Pedersen, Christian R.
Rasmussen, Rasmus V.
Andersen, Kim A.
机构：
[1] Aarhus Univ, Dept Operat Res, DK-8000 Aarhus C, Denmark
[2] Aarhus Sch Business, Dept Accounting Finance & Logist, DK-8210 Aarhus V, Denmark
来源：
COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 07期
关键词：
large-scale scheduling; elastic jobs; precedence constraints; practical application; tabu search; ALGORITHM; MAKESPAN;
D O I：
10.1016/j.cor.2005.08.001
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码：2025 / 2042
页数：18
相关论文
共 50 条
  • [21] Solving large-scale 0-1 integer programming models with tabu search
    Hanafi, S
    Amrani, F
    Freville, A
    FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 32 - 39
  • [22] Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
    Roslöf, J
    Harjunkoski, I
    Westerlund, T
    Isaksson, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 138 (01) : 29 - 42
  • [23] Formulation and tabu search algorithm for the resource constrained project scheduling problem
    Nonobe, K
    Ibaraki, T
    ESSAYS AND SURVEYS IN METAHEURISTICS, 2002, 15 : 557 - 588
  • [24] A metaheuristic based on tabu search for solving a technician routing and scheduling problem
    Mathlouthi, Ines
    Gendreau, Michel
    Potvin, Jean-Yves
    COMPUTERS & OPERATIONS RESEARCH, 2021, 125
  • [25] SOLVING A GENERAL ROUTING AND SCHEDULING PROBLEM BY CHAIN DECOMPOSITION AND TABU SEARCH
    HOOKER, JN
    NATRAJ, NR
    TRANSPORTATION SCIENCE, 1995, 29 (01) : 30 - 44
  • [26] Solving the Problem of Large-Scale Optimal Scheduling of Distributed Energy Resources in Smart Grids Using an Improved Variable Neighborhood Search
    Ramli, Makbul A. M.
    Bouchekara, Houssem R. E. H.
    IEEE ACCESS, 2020, 8 : 77321 - 77335
  • [27] Complexity and approximation for the precedence constrained scheduling problem with large communication delays
    Giroudeau, R
    König, JC
    Moulaï, FK
    Palaysi, J
    EURO-PAR 2005 PARALLEL PROCESSING, PROCEEDINGS, 2005, 3648 : 252 - 261
  • [28] LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search
    Mireille Palpant
    Christian Artigues
    Philippe Michelon
    Annals of Operations Research, 2004, 131 : 237 - 257
  • [29] Large-scale var optimization and planning by tabu search
    Gan, DQ
    Qu, ZH
    Cai, HZ
    ELECTRIC POWER SYSTEMS RESEARCH, 1996, 39 (03) : 195 - 204
  • [30] LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
    Palpant, M
    Artigues, C
    Michelon, P
    ANNALS OF OPERATIONS RESEARCH, 2004, 131 (1-4) : 237 - 257
12345