Optimal methods for resource allocation and scheduling: A cross-disciplinary survey

Constraints

Volumn 17, Issue 1, 2012, Pages 51-85

  Lombardi, Michele ^a   Milano, Michela ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Constraint programming; Hybrid algorithms; Operations research; Resource allocation; Scheduling

Indexed keywords

CONSTRAINT PROGRAMMING; CONSTRAINT-BASED; CROSS-DISCIPLINARY; DECISION MAKERS; FILTERING METHOD; GLOBAL CONSTRAINTS; HYBRID ALGORITHMS; HYBRID APPROACH; KEY MODELING; OPTIMAL METHODS; PERFORMANCE METRICES; RESOURCE ASSIGNMENT; SCHEDULING PROBLEM; SCHEDULING VARIABLE; SEARCH STRATEGIES; SOLUTION TECHNIQUES; STATIC RESOURCE;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPERATIONS RESEARCH; OPTIMIZATION; RESEARCH; RESOURCE ALLOCATION; SURVEYS;

SCHEDULING;

EID: 84856591091     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-011-9115-6     Document Type: Review

References (94)

1. P Baptiste P Laborie C Le Pape W Nuijten 2006 Constraint-based scheduling and planning Foundations of Artificial Intelligence 2 761 799 10.1016/S1574-6526(06)80026-X
2. P Baptiste C Le Pape 1996 Disjunctive constraints for manufacturing scheduling: Principles and extensions International Journal of Computer Integrated Manufacturing 9 4 306 310 10.1080/095119296131616 (Pubitemid 126683355)
3. Baptiste, P.; Le Pape, C.; & Nuijten, W. (2001). Constraint-based scheduling. Kluwer Academic Publishers.
4. Barták, R.; & Cepek, O. (2008). Nested precedence networks with alternatives: Recognition, tractability, and models. In Proc. of AIMSA (pp. 235-246).
5. Barták, R.; Cepek, O.; & Surynek, P. (2007). Modelling alternatives in temporal networks. In Proc. of IEEE SCIS (pp. 129-136). (Pubitemid 47431192)
6. R Barták O Čepek M Hejna 2008 Temporal reasoning in nested temporal networks with alternatives Recent Advances in Constraints, LNCS 5129 17 31 10.1007/978-3-540-89812-2-2
7. R Barták O Čepek P Surynek 2008 Discovering implied constraints in precedence graphs with alternatives Annals of Operations Research 180 1 233 263 10.1007/s10479-008-0492-1
8. M Bartusch RH Möhring FJ Radermacher 1988 Scheduling project networks with resource constraints and time windows Annals of Operations Research 16 1 199 240 10.1007/BF02283745
9. EML Beale JJH Forrest 1976 Global optimization using special ordered sets Mathematical Programming 10 1 52 69 418920 0331.90056 10.1007/BF01580653
10. JE Beasley M Krishnamoorthy 2000 Scheduling aircraft landings-the static case Transportation Science 34 2 180 197 1004.90511 10.1287/trsc.34.2.180.12302
11. Beck, J. C.; & Fox, M. S. (1999). Scheduling alternative activities. In Proc. of AAAI/IAAI (pp. 680-687).
12. JC Beck MS Fox 2000 Constraint-directed techniques for scheduling alternative activities Artificial Intelligence 121 1-2 211 250 1783518 0948.68009 10.1016/S0004-3702(00)00035-7
13. N Beldiceanu M Carlsson S Demassey E Poder 2011 New filtering for the cumulative constraint in the context of non-overlapping rectangles Annals of Operations Research 184 1 27 50 2777096 1214.90100 10.1007/s10479-010-0731-0
14. O Bellenguez-Morineau E Néron 2007 A Branch-and-Bound method for solving multi-skill project scheduling problem RAIRO - Operations Research 41 02 155 170 2341438 1154.90413 10.1051/ro:2007015 (Pubitemid 47154328)
15. JF Benders 1962 Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1 238 252 147303 0109.38302 10.1007/BF01386316
16. Benini, L.; Bertozzi, D.; Guerri, A.; & Milano, M. (2005). Allocation and scheduling for MPSoCs via decomposition and no-good generation. In Proc. of CP (pp. 107-121).
17. L Benini M Lombardi M Milano M Ruggiero 2011 Optimal allocation and scheduling for the cell BE platform Annals of Operations Research 184 1 51 77 2777097 1214.90050 10.1007/s10479-010-0718-x
18. P Brucker A Drexl RH Möhring K Neumann E Pesch 1999 Resource-constrained project scheduling: Notation, classification, models, and methods European Journal of Operational Research 112 1 3 41 0937.90030 10.1016/S0377-2217(98)00204-5
19. J Buddhakulsomsiri D Kim 2006 Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting European Journal of Operational Research 175 1 279 295 1137.90483 10.1016/j.ejor.2005.04.030 (Pubitemid 44470722)
20. Burkard, R. E.; Dell'Amico, M.; & Martello, S. (2009). Assignment problems. Society for Industrial Mathematics.
21. Cambazard, H.; Hladik, P. E.; Déplanche, A. M.; Jussien, N.; & Trinquet, Y. (2004). Decomposition and learning for a hard real time task allocation problem. In Proc. of CP (pp. 153-167).
22. Cesta, A.; Oddi, A.; & Smith, S. F. (1998). Scheduling multi-capacitated resources under complex temporal constraints. In Proc. of CP (pp. 465-465).
23. N Christofides R Alvarez-Valdes JM Tamarit 1987 Project scheduling with resource constraints: A branch and bound approach European Journal of Operational Research 29 3 262 273 891312 0614.90056 10.1016/0377-2217(87)90240-2 (Pubitemid 17598425)
24. Coban, E.; & Hooker, J. N. (2010). Single-facility scheduling over long time horizons by logic-based benders decomposition. In Proc. of CPAIOR (pp. 87-91).
25. B De Reyck E Demeulemeester W Herroelen 1998 Local search methods for the discrete time/resource trade-off problem in project networks Naval Research Logistics 45 6 553 578 1639783 0948.90065 10.1002/(SICI)1520-6750(199809)45: 6<553::AID-NAV2>3.0.CO;2-1
26. F Deblaere E Demeulemeester W Herroelen 2010 Reactive scheduling in the multimode RCPSP Computers & Operations Research 38 1 1 12 2679216
27. R Dechter I Meiri J Pearl 1991 Temporal constraint networks Artificial Intelligence 49 1-3 61 95 1112649 0737.68070 10.1016/0004-3702(91)90006-6 (Pubitemid 21679936)
28. E Demeulemeester B De Reyck W Herroelen 2000 The discrete time/resource trade-off problem in project networks: A branch-and-bound approach IIE Transactions 32 11 1059 1069
29. EL Demeulemeester W Herroelen 1992 A branch-and-bound procedure for multiple resource-constrained project scheduling problem Management Science 38 12 1803 1818 0761.90059 10.1287/mnsc.38.12.1803
30. A Drexl J Gruenewald 1993 Nonpreemptive multi-mode resource-constrained project scheduling IIE Transactions 25 5 74 81 10.1080/07408179308964317
31. Elmaghraby, S. E. (1977). Activity networks: Project planning and control by network models. New York: Wiley.
32. SE Elmaghraby J Kamburowski 1992 The analysis of activity networks under generalized precedence relations (GPRs) Management Science 38 9 1245 1263 0758.90044 10.1287/mnsc.38.9.1245
33. AT Ernst M Krishnamoorthy RH Storer 1999 Heuristic and exact algorithms for scheduling aircraft landings Networks 34 3 229 241 0980.90031 10.1002/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W (Pubitemid 129319307)
34. Focacci, F.; Laborie, P.; & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Proc. of ICAPS.
35. Focacci, F.; Lodi, A.; & Milano, M. (1999). Cost-based domain filtering. In Proc. of CP (pp. 189-203).
36. Gambardella, L. M.; & Mastrolilli, M. (1996). Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3, 3.
37. I Harjunkoski V Jain IE Grossman 2000 Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems Computers & Chemical Engineering 24 2-7 337 343 10.1016/S0098-1354(00)00470-1 (Pubitemid 30608251)
38. S Hartmann A Drexl 1998 Project scheduling with multiple modes: A comparison of exact algorithms Networks 32 4 283 297 1660047 1002.90025 10.1002/(SICI)1097-0037(199812)32:4<283::AID-NET5>3.0.CO;2-I (Pubitemid 128164809)
39. R Heilmann 2003 A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags European Journal of Operational Research 144 2 348 365 1936299 1012.90513 10.1016/S0377-2217(02)00136-4 (Pubitemid 35214208)
40. Hooker, J. (2000). Logic-based methods for optimization: Combining optimization and constraint satisfaction. New York: Wiley.
41. JN Hooker 2005 A hybrid method for planning and scheduling Constraints 10 4 385 401 2185319 1122.90054 10.1007/s10601-005-2812-2 (Pubitemid 41521315)
42. Hooker, J. N. (2005). Planning and scheduling to minimize tardiness. In Proc. of CP (Vol. 3709, pp. 314-327).
43. JN Hooker 2006 An integrated method for planning and scheduling to minimize trdiness Constraints 11 2-3 139 157 2224848 1103.68811 10.1007/s10601-006-8060-2
44. JN Hooker 2007 Planning and scheduling by logic-based benders decomposition Operations Research 55 3 588 2330961 1167.90512 10.1287/opre.1060.0371 (Pubitemid 351159511)
45. JN Hooker G Ottosson 2003 Logic-based Benders decomposition Mathematical Programming 96 1 33 60 1974166 1023.90082 (Pubitemid 44757847)
46. Hooker, J. N.; & Yan, H. (1995). Verifying logic circuits by Benders decomposition. In Proc. of CP (pp. 267-288).
47. G Igelmund FJ Radermacher 1983 Preselective strategies for the optimization of stochastic project networks under resource constraints Networks 13 1 1 28 693853 0504.90039 10.1002/net.3230130102 (Pubitemid 13506133)
48. V Jain IE Grossmann 2001 Algorithms for hybrid MILP/CP models for a class of optimization problems INFORMS Journal on Computing 13 4 258 276 1869880 10.1287/ijoc.13.4.258.9733 (Pubitemid 33645944)
49. Kelley, J.E.; & Walker, M. R. (1959) Critical-path planning and scheduling. In Proc. of eastern joint IRE-AIEE-ACM conference (pp. 160-173). ACM: New York.
50. R Kolisch 1997 PSPLIB - A project scheduling problem library European Journal of Operational Research 96 1 205 216 10.1016/S0377-2217(96)00170-1 (Pubitemid 127415922)
51. R Kolisch A Drexl 1997 Local search for nonpreemptive multi-mode resource-constrained project scheduling IIE Transactions 29 11 987 999 (Pubitemid 127755105)
52. YK Kwok 1996 Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors Parallel and Distributed Systems 7 5 506 521 10.1109/71.503776
53. YK Kwok I Ahmad 1999 Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Computing Surveys (CSUR) 31 4 406 471 10.1145/344588.344618
54. Laborie, P. (2005). Complete MCS-based search: Application to resource constrained project scheduling. In Proc. of IJCAI (pp. 181-186). Professional Book Center.
55. Laborie, P. (2009). IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In Proc. of CPAIOR (pp. 148-162).
56. Laborie, P.; & Godard, D. (2007). Self-adapting large neighborhood search: Application to single-mode scheduling problems. In Proc. of MISTA.
57. Laborie, P.; & Rogerie, J. (2008). Reasoning with conditional time-intervals. In Proc. of FLAIRS (pp. 555-560).
58. Laborie, P.; Rogerie, J.; Shaw, P.; & Vilìm, P. (2009). Reasoning with conditional time-intervals part II: An algebraical model for resources. In Proc. of FLAIRS (pp. 201-206).
59. Le Pape, C. (1994). Using a constraint-based scheduling library to solve a specific scheduling problem. In Proc. of AAAI-SIGMAN.
60. Le Pape, C.; Couronné, P.; Vergamini, D.; & Gosselin, V. (1994). Time-versus-capacity compromises in project scheduling. In Proc. of PLANSIG.
61. Leupers, R. (2000). Instruction scheduling for clustered VLIW DSPs. In Proc. of PACT (pp. 291-).
62. Lombardi, M.; & Milano, M. (2009). A precedence constraint posting approach for the RCPSP with time lags and variable durations. In Proc. of CP (pp. 569-583).
63. M Lombardi M Milano 2010 Allocation and scheduling of conditional task graphs Artificial Intelligence 174 7-8 500 529 2642296 1186.90054 10.1016/j.artint.2010.02.004
64. Moffitt, M. D.; Peintner, B.; & Pollack, M. E. (2005). Augmenting disjunctive temporal problems with finite-domain constraints. In Proc. of AAAI (pp. 1-6).
65. Nuijten, W. (1994). Time and resource constrained scheduling: A constraint satisfaction approach. PhD thesis, Technische Universiteit Eindhoven.
66. Nuijten, W.; Bousonville, T.; Focacci, F.; Godard, D.; & Le Pape, C. (2004). Towards an industrial manufacturing scheduling problem and test bed. In Proc. of PMS.
67. Nuijten, W. P. M.; Aarts, E. H. L.; van Arp Talmaan Kip, D.A.A.; & van Hee, K.M. (1993). Randomized constraint satisfaction for job shop scheduling. In Proc. of IJCAI (pp. 251-262). Chambery, France.
68. Patterson, J.H.; Slowinski, R.; Talbot, F.B.; & Weglarz, J. (1989). An algorithm for a general class of precedence and resource constrained scheduling problems. In R. Slowinski & J. Weglarz (Eds.), Advances in Project Scheduling (Part I, Chapter I, pp. 3-28). Amsterdam: Elsevier Science Publishers.
69. Pessan, C.; Bellenguez-Morineau, O.; & Néron, E. (2007). Multi-skill project scheduling problem and total productive maintenance. In Proceedings of MISTA (pp. 608-610).
70. Poder, E.; & Beldiceanu, N. (2008). Filtering for a continuous multi-resources cumulative constraint with resource consumption and production. In Proc. of ICAPS (pp. 264-271).
71. N Policella A Cesta A Oddi SF Smith 2007 From precedence constraint posting to partial order schedules: A CSP approach to robust scheduling AI Communications 20 3 163 180 2405466 1146.90421 (Pubitemid 47509353)
72. FJ Radermacher 1985 Scheduling of project networks Annals of Operations Research 4 1 227 252 948019 0693.90046 10.1007/BF02022042
73. Ruggiero, M.; Pari, G.; Guerri, A.; Benini, L.; Milano, M.; Bertozzi, D.; et al. (2007). A cooperative, accurate solving framework for optimal allocation, scheduling and frequency selection on energy-efficient mpsocs. In Proc. of SoC (pp. 1-4). IEEE.
74. M Sabzehparvar SM Seyed-Hosseini 2007 A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags The Journal of Supercomputing 44 3 257 273 10.1007/s11227-007-0158-9
75. Schutt, A.; Feydy, T.; Stuckey, P.J.; & Wallace, M. (2009). Why cumulative decomposition is not as bad as it sounds. In Proc. of CP (pp. 746-761).
76. Schwindt, C. (1998). Verfahren zur Lösung des ressourcenbeschrä nkten Projektdauerminimierungsproblems mit planungsabhängigen Zeitfenstern. Shaker.
77. Smith, S. F.; Cheng, C. C. (1993). Slack-based heuristics for constraint satisfaction scheduling. In Proc. of AAAI (pp. 139-139).
78. S Kedad-Sidhoum YR Solis F Sourd 2008 Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates European Journal of Operations Research 189 3 1305 1316 2400927 1146.90030 10.1016/j.ejor.2006.05.052 (Pubitemid 351400568)
79. A Sprecher A Drexl 1998 Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm European Journal of Operational Research 107 2 431 450 0943.90042 10.1016/S0377-2217(97) 00348-2 (Pubitemid 128407555)
80. A Sprecher S Hartmann A Drexl 1997 An exact algorithm for project scheduling with multiple modes OR Spectrum 19 3 195 203 1464665 0885.90059 10.1007/BF01545587
81. Sprecher, A.; & Hwang, C. L. (1994). Resource-constrained project scheduling: Exact methods for the multi-mode case. New York: Springer.
82. A Sprecher R Kolisch A Drexl 1995 Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem European Journal of Operational Research 80 1 94 102 0927.90054 10.1016/0377-2217(93) E0294-8
83. JP Stinson EW Davis BM Khumawala 1978 Multiple resource-constrained scheduling using branch and bound IIE Transactions 10 3 252 259
84. FB Talbot 1982 Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case Management Science 28 10 1197 1210 0493.90042 10.1287/mnsc.28.10.1197
85. Thorsteinsson, E. S. (2001). Branch and check: A hybrid framework integrating mixed integer programming and constraint programming. In Proc. of CP (pp. 16-30). Paphos, Cyprus. (Pubitemid 33371064)
86. C Timpe 2002 Solving planning and scheduling problems with combined integer and constraint programming OR Spectrum 24 4 431 448 1028.90017 10.1007/s00291-002-0107-1
87. Toth, P.; & Vigo, D. (2002). The vehicle routing problem (Vol. 9). Society for Industrial Mathematics.
88. V Van Peteghem M Vanhoucke 2010 A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem European Journal of Operational Research 201 2 409 418 2552443 1175.90205 10.1016/j.ejor.2009.03.034
89. Vilím, P. (2009). Max energy filtering algorithm for discrete cumulative resources. In Proc. of CPAIOR (pp. 294-308).
90. Vilím, P. (2011). Timetable edge finding filtering algorithm for discrete cumulative resources. In Proc. of CPAIOR (pp. 230-245).
91. P Vilím R Barták O Cepek 2005 Extension of (n log n) filtering algorithms for the unary resource constraint to optional activities Constraints 10 4 403 425 2185320 1122.90045 10.1007/s10601-005-2814-0 (Pubitemid 41521316)
92. S Vo A Witt 2007 Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application International Journal of Production Economics 105 2 445 458 10.1016/j.ijpe.2004.05.029 (Pubitemid 44827612)
93. JC Zapata BM Hodge GV Reklaitis 2008 The multimode resource constrained multiproject scheduling problem: Alternative formulations AIChE Journal 54 8 2101 2119 10.1002/aic.11522
94. G Zhu JF Bard G Yu 2006 A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem INFORMS Journal on Computing 18 3 377 390 10.1287/ijoc.1040.0121 (Pubitemid 44371778)