Erratum to: A parallel complete anytime procedure for project scheduling under multiple resource constraints (International Journal of Advanced Manufacturing Technology DOI: 10.1007/s00170-009-2483-z);A parallel complete anytime procedure for project scheduling under multiple resource constraints

International Journal of Advanced Manufacturing Technology

Volumn 50, Issue 1-4, 2010, Pages 353-362

  Zamani, Reza ^a  

^a NONE

Author keywords

Anytime search; Branch and bound; Heuristic; Implicit enumeration; Project scheduling

Indexed keywords

BENCHMARKING; BRANCH AND BOUND METHOD; OPTIMAL SYSTEMS; OPTIMIZATION; PERSONAL COMPUTERS;

ANYTIME SEARCH; COMPUTATIONAL EXPERIMENT; FORWARD-AND-BACKWARD; HEURISTIC; IMPLICIT ENUMERATION; MULTIPLE RESOURCE CONSTRAINT; PROJECT SCHEDULING; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM;

SCHEDULING;

EID: 77958032836     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2542-5     Document Type: Erratum

References (42)

1. Boddy M, Dean T (1989) Solving time-dependent planning problems in IJCAI. Detroit, MI
2. Korf RE (1998) A complete anytime algorithm for number partitioning. Artif Intell 106(2):181-203
3. Möhring RH et al (2003) Solving project scheduling problems by minimum cut computations. Manag Sci 49(3):330-350
4. Agarwal R, Tiwari M, Mukherjee S (2007) Artificial immune system based approach for solving resource constraint project scheduling problem. Int J Adv Manuf Technol 34(5):584-593
5. Chen R-M, Lo S-T (2006) Using an enhanced ant colony system to solve resource-constrained project scheduling problem. Int J Comput Sci Network Security 6(11):75-84
6. Debels D et al (2006) A hybrid scatter search/electromagnetism metaheuristic for project scheduling. Eur J Oper Res 169(2):638-653
7. Tseng L-Y, Chen S-C (2006) A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur J Oper Res 175(2):707-721
8. Valls V, Ballestin F, Quintanilla S (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165(2):375-386
9. Fleszar K, Hindi KS (2004) Solving the resource-constrained project scheduling problem by a variable neighbourhood search. Eur J Oper Res 155(2):402-413
10. Palpant M, Artigues C, Michelon P (2004) LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search. Ann Oper Res 131(1):237-257
11. Valls V, Ballestin F, Quintanilla S (2004) A population-based approach to the resource-constrained project scheduling problem. Ann Oper Res 131(1z):305-324
12. Zamani R (2004) An efficient time-windowing procedure for scheduling projects under multiple resource constraints. OR Spectrum 26(3):423-440
13. Artigues C, Michelon P, Reusser S (2003) Insertion techniques for static and dynamic resource-constrained project scheduling. Eur J Oper Res 149(2):249-267
14. Kochetov, Y.A. and A.A. Stolyar. Evolutionary local search with variable neighbourhood for the resource constrained scheduling problem. In: Proceedings of the 3rd International Workshop on Computer Science and Information Technology, 2003. Ufa, Russia
15. Valls V, Quintanilla S, Ballestin F (2003) Resource-constrained project scheduling: a critical activity reordering heuristic. Eur J Oper Res 149(2):282-301
16. Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Nav Res Logistics 49:433-448
17. Sprecher A (2002) Network decomposition techniques for resourceconstrained project scheduling. Oper Res Soc 53:405-414
18. Klein R (2000) Bidirectional planning: improving priority rulebased heuristics for scheduling resource-constrained projects. Eur J Oper Res 127(3):619-638
19. Özdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IIE Transactions 27:574-586
20. Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Int J Manage Sci (omega) 29:249-272
21. Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174(1):23-37
22. Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90:320-333
23. Baptiste P, Demassey S (2004) Tight LP bounds for resource constrained project scheduling. OR Spectrum 26(2):251-262
24. Brucker P (2002) Scheduling and constraint propagation. Discrete Appl Math 123(1-3):227-256
25. Zamani R (2001) A high-performance exact method for the resource-constrained project scheduling problem. Comput Oper Res 28(14):1387-1401
26. Brucker P, Knust S (2000) A linear programming and constraint propagation-based lower bound for the RCPSP. Eur J Oper Res 127(2):355-362
27. Sprecher A (2000) Scheduling resource-constrained projects competitively at modest memory requirement. Manag Sci 46:710-723
28. Klein R, Scholl A (1999) Computing lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Oper Res 112:322-346
29. Nazareth T et al (1999) The multiple resource constrained project scheduling problem: a breadth-first approach. Eur J Oper Res 112 (2):347-366
30. Mingozzi A et al (1998) An exact algorithm for the resourceconstrained project scheduling problem based on a new mathematical formulation. Manag Sci 44:714-729
31. Zamani R, Shue LY (1998) Solving project scheduling problems with heuristic learning algorithm. J Oper Res Soc 49:709-716
32. Demeulemeester E, Herroelen W (1992) A branch-and-bound procedure for multiple resource-constrained project scheduling problem. Manag Sci 38:1803-1818
33. Demeulemeester E, Herroelen W (1997) A new benchmark results for the resource-constrained project scheduling problem. Management Science 43:1485-1492 (Pubitemid 127606206)
34. Li K,Willis R (1992) An iterative scheduling technique for resourceconstrained project scheduling. Eur J Oper Res 56:370-379
35. Tormos P, Lova A (2001) A competitive heuristic solution technique for resource-constrained project scheduling. Ann Oper Res 102 (1):65-81 (Pubitemid 33634387)
36. Zamani R (2004) An effective near-optimal state-space search method: an application to a scheduling problem. Artif Intell Rev 22(1):41-69
37. Zamani R (2005) A hybrid of search efficiency mechanisms: PLH2. Intell Syst 14(2):265-278
38. Schrage L (1969) Solving resource-constrained network problems by implicit enumeration non-preemptive case. Oper Res 18(2):263-278
39. Stinson JP (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Transactions 28(1):1-7
40. Brand JD, Meyer WL, Shaffer LR (1964) The resource scheduling problem in construction. In: Construction Research Series No. 5, University of Illinois, Urbana, IL
41. Kolisch R, Sprecher A (1996) PSPLIB-a project scheduling library. Eur J Oper Res 96:205-216
42. Zamani R, Lau SK (2010) Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem. Eur J Oper Res 201:82-88