Insertion techniques for static and dynamic resource-constrained project scheduling

European Journal of Operational Research

Volumn 149, Issue 2, 2003, Pages 249-267

  Artigues, Christian ^a   Michelon, Philippe ^a   Reusser, Stéphane ^a  

^a UNIVERSITY OF AVIGNON   (France)

Author keywords

Activity insertion; Activity on node flow network; Resource constrained project scheduling; Robust scheduling; Tabu search

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; RESOURCE ALLOCATION; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

PROJECT SCHEDULING;

PROJECT MANAGEMENT;

EID: 0038522575     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00758-0     Document Type: Conference Paper

References (15)

1. Artigues C., Roubellat F. A polynomial insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. European Journal of Operational Research. 127(2):2000;297-316.
2. Artigues C., Roubellat F. An efficient algorithm for operation insertion in practical jobshop schedules. Production Planning and Control. 13(2):2002;175-186.
3. Baptiste P., Le Pape C. Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints. 5(1):2000;119-139.
4. Baar T., Brucker P., Knust S. Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. Voss S., Martello S., Osman I., Roucairol C. Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. 1998;1-18 Kluwer Academic Publishers.
5. Brucker P., Neyer J. Tabu-search for the multi-mode job-shop problem. OR Spekrum. 20(1):1998;21-28.
6. Brucker P., Drexl A., Möring R., Neumann K., Pesch E. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research. 112(1):1999;3-41.
7. Dauzère Pérès S., Roux W., Lasserre J.B. Multi-resource shop scheduling with resource flexibility. European Journal of Operational Research. 107(2):1998;289-305.
8. Fortemps P., Hapke M. On the disjunctive graph for project scheduling. Foundations of Computing and Decision Sciences. 22(3):1997;195-209.
9. Hartmann S. A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics. 45(7):1998;733-750.
10. Hartmann S., Kolisch R. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research. 127(2):2000;297-316.
11. Klein R., Scholl A. Computing lower bound by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research. 112(2):1999;322-346.
12. Kolisch R., Sprecher A., Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problem. Management Science. 41(10):1995;1693-1703.
13. Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management. 14(3):1996;179-192.
14. Kolisch R., Hartmann S. Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. Weglarz J. Project Scheduling: Recent Models, Algorithms and Applications. 1998;147-178 Kluwer Academic Publishers.
15. R.J.M. Vaessens, Generalized job shop scheduling: complexity and local search, Ph.D. thesis, Eindhoven University of Technology, 1995.