Project scheduling with multi-purpose resources: A combined MILP/CP decomposition approach

International Journal of Operations and Quantitative Management

Volumn 12, Issue 4, 2006, Pages 305-325

  Li, Haitao ^a   Womer, Keith ^b  

^a TROY UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Combined MILP CP approach; Constraint programming; Multi skilled personnel; Project scheduling; Resource constraints

Indexed keywords

EID: 67349107411     PISSN: 10821910     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (45)

1. Badiru AB (1988). Project Management in Manufacturing and High Technology Operations. New York: Wiley.
2. Baptiste P Le Pape C and Nuijten W (2001). Constraint-Based Scheduling: applying constraint programming to scheduling problems: Kluwer Academic Publishers.
3. Bellenguez O and Néron E (2004). Methods for solving the multi-skill project scheduling problem, in Proceedings of the Ninth International Workshop on Project Management and Scheduling, Nancy, France.
4. Benoist T Laburthe F and Rotternbourg B (2001). Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems, in Integration of AI and OR Techniques in Constraint.
5. Blazewicz J Lenstra JK and Rinnooy Kan AHG (1983). Scheduling projects subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 5: 11-24.
6. Brucker P (2002). Scheduling and constraint propagation. Discrete Applied Mathematics, 123(1-3): 227-256.
7. Brucker P Drexl A Möhring RH Neumann K and Pesch E (1999). Resource-constrained project scheduling: Notation, classification, models and methods. European Journal of Operational Research, 112(1): 3-41.
8. Chu Y and Xia Q (2005). A hybrid algorithm for a class of resource-constrained scheduling problems, in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005): Springer.
9. Cleland DI and King WR (1983). System Analysis and Project Management. New York: McGraw-Hill.
10. Demassey S Artigues C and Michelon P (2005). Constraint propagation based cutting lanes: an application to the resource-constrained project scheduling problem. INFORMS Journal on Computing, 17(1): 52-65.
11. Demeulemeester E (1995). Minimizing resource-availability costs in time-limited project networks. Management Science, 41: 1590-1598.
12. Dorndorf U Pesch E and Phan-Huy T (2000). A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints. Management Science, 46(10): 1365-1384.
13. Drexl A Juretzka J Salewski F and Schirmer A (1998). New modeling concepts and their impact on resource-constrained project scheduling, in Project Scheduling: Recent Models, Algorithms and Applications, J. Weglarz, Editor, Kluwer Academic Publishers.
14. Drexl A and Kimms A (2001). Optimization guided lower and upper bounds for the resource investment problem. Journal of Operational Research Society, 52: 340-351.
15. Easton K Nemhauser G and Trick M (2004). CP based branch-and-price, in Constraint and integer programming, M. Milano, Editor, Springer.
16. Eremin A and Wallace M (2001). Hybrid Benders decomposition algorithms in constraint logic programming. LNCS, (2239): 1-15.
17. Focacci F Laborie P and Nuijten W (2000). Solving scheduling problems with setup times and alternative resources, in Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling.
18. Hooker J (2002). Logic, optimization and constraint programming. INFORMS Journal on Computing, 14(4): 285-321.
19. Hooker JN (2004). A hybrid method for planning and scheduling, in Principles and Practice of Constraint Programming (CP2004): Springer.
20. ILOG (2002). ILOG Solver 5.3 User's Manual. ILOG Inc.
21. ILOG (2002). ILOG CPLEX 8.1 User's Manual. ILOG Inc.
22. ILOG (2002). ILOG Scheduler 5.3 User's Manual. ILOG Inc.
23. ILOG (2002). OPL Studio 3.6.1 User's Manual. ILOG, Inc.
24. Jain V and Grossmann I (2001). Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems. INFORMS Journal on Computing, 13(4): 258-276.
25. Kelly J (1961). Critical-path planning and scheduling: mathematical basis. Operations Research, 9(3): 296-320.
26. Kolisch R Sprecher A and Drexel A (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41(10): 1693-1703.
27. Li H Dula J Lewis K and Womer K (2004). Using constraint programming to solve a project scheduling problem with skilled labor, in 14th International Conference on Automated Planning and Scheduling Workshops, British Columbia, Canada.
28. Lustig IJ and Puget J-F (2001). Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces, 31: 29-53.
29. Malcolm DG Roseboom JH Clark CE and Fazar W (1959). Applications of a technique for research and development program evaluation. Operations Research, 7(5): 646-669.
30. Möhring RH (1984). Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research, 32: 89-120.
31. Néron E Bellenguez O and Heurtebise M (2006). Decomposition method for solving multi-skill project scheduling problem, in Proceedings of the Tenth International Workshop on Project Management and Scheduling, Ponznan.
32. Neumann K Schwindt C and Zimmermann J (2001). Project Scheduling with Time Windows and Scarce Resources: Temporal and resource-constrained project scheduling with regular and nonregular objective functions. New York: Springer.
33. Nübel H (1999). A branch-and-bound procedure for the resource investment problem subject to temporal constraints, in Report WIOR-574, University of Karlsruhe.
34. Rousseau L-M Gendreau M Pesant G and Focacci F (2004). Solving VRPTWs with constraint programming based column generation. Annals of Operations Research, 130: 199-216.
35. Salewski F Schirmer A and Drexl A (1997). Project scheduling under resource and mode identity constraints: model, complexity, methods and application. European Journal of Operational Research, 102: 88-110.
36. Schwindt C (1996). Generation of resource-constrained project scheduling problems with minimal and maximal time lags, in Technical Report WIOR-489, Institute für Wirtschaftstheorie und Operations Research, University of Karlsruhe.
37. Sellmann M and Fahle T (2003). Constraint programming based lagrangian relaxation for the automatic recording problem. Annals of Operations Research, 118: 17-33.
38. Talbot FB (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science, 28: 1197-1210.
39. Thesen A (1977). Measures of the restrictiveness of project networks. Networks, 7: 193-208.
40. Timpe C (2002). Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum, 24: 431-448.
41. Tsang E (1993). Foundations of Constraint Satisfaction: Academic Press.
42. Van Hentenryck P (1999). The OPL Optimization Programming Language: The MIT Press.
43. Wiest JD (1963). The Scheduling of Large Projects with Limited Resources, in Unpublished PhD Thesis, Carnegie Institute of Technology: Pittsburgh.
44. Williams H (1999). Modeling Building in Mathematical Programming. 4th ed. New York: Wiley.
45. Yunes T Moura A and De Souza C (2000). Solving very large crew scheduling problems to optimality, in Proceedings of the 2000 ACM Symposium on Applied Computing, Corno, Italy.