Symmetry breaking of identical projects in the high-multiplicity RCPSP/max

References

• Artigues, C. (2017). On the strength of time-indexed formulations for the resource-constrained project scheduling problem. Operations Research Letters, 45(2), 154–159. doi:10.1016/j.orl.2017.02.001
   Web of Science ®Google Scholar
• Bartusch, M., Möhring, R. H., & Radermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16( 1), 199–240. doi:10.1007/BF02283745
   Google Scholar
• Bianco, L., & Caramia, M. (2013). A new formulation for the project scheduling problem under limited resources. Flexible Services and Manufacturing Journal, 25(1–2), 6–24. doi:10.1007/s10696-011-9127-y
   Web of Science ®Google Scholar
• Blazewicz, J., Lenstra, J., & Kan, A. (1983). Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 5(1), 11–24. doi:10.1016/0166-218X(83)90012-4
   Web of Science ®Google Scholar
• Boudoukh, T., Penn, M., & Weiss, G. (2001). Scheduling jobshops with some identical or similar jobs. Journal of Scheduling, 4 (4), 177–199. doi:10.1002/jos.72
   Web of Science ®Google Scholar
• Brucker, P., Drexl, A., Mohring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112(1), 3–41. doi:10.1016/S0377-2217(98)00204-5
   Web of Science ®Google Scholar
• Carlier, J., & Néron, E. (2007). Computing redundant resources for the resource constrained project scheduling problem. European Journal of Operational Research, 176(3), 1452–1463. doi:10.1016/j.ejor.2005.09.034
   Web of Science ®Google Scholar
• Christofides, N., Alvarez-Valdes, R., & Tamarit, J. (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 29(3), 262–273. doi:10.1016/0377-2217(87)90240-2
   Web of Science ®Google Scholar
• Confessore, G., Giordani, S., & Rismondo, S. (2007). A market-based multi-agent system model for decentralized multi-project scheduling. Annals of Operations Research, 150 (1), 115–135. doi:10.1007/s10479-006-0158-9
   Web of Science ®Google Scholar
• Edwards, S., Baatar, D., Bowly, S., & Smith-Miles, K. (2017). Symmetry breaking in a special case of the RCPSP/max (pp. 315–318). Presented at Proceedings of the 8th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2017), December 5–8, 2017, Kuala Lumpur, Malaysia.
   Google Scholar
• Franck, B., Neumann, K., & Schwindt, C. (2001). Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR-Spektrum, 23(3), 297–324. doi:10.1007/PL00013356
   Google Scholar
• Francios, M. (2010). 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. In M. Juenger, D. Naddef, W. R. Pulleyblank, G. Reinelt, T. M. Liebling, G. L. Nemhauser, & L. A. Wolsey (Eds.), Symmetry in Integer Linear Programming (Chapter 17, pp. 647–686). Berlin, Heidelberg: Springer.
   Google Scholar
• Gent, I. P., Petrie, K. E., & Puget, J.-F. (2006). Symmetry in constraint programming. In Handbook of Constraint Programming (pp. 329–376). Elsevier.
   Google Scholar
• Haouari, M., Kooli, A., & Néron, E. (2012). Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. Computers and Operations Research, 39(5), 1187–1194. doi:10.1016/j.cor.2011.05.022
   Web of Science ®Google Scholar
• Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207(1), 1–14. doi:10.1016/j.ejor.2009.11.005
   Web of Science ®Google Scholar
• Hidri, L., Gharbi, A., & Haouari, M. (2008). Energetic reasoning revisited: Application to parallel machine scheduling. Journal of Scheduling, 11(4), 239–252. doi:10.1007/s10951-008-0070-z
   Web of Science ®Google Scholar
• Hochbaum, D. S., & Shamir, R. (1991). Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, 39(4), 648–653. doi:10.1287/opre.39.4.648
   Web of Science ®Google Scholar
• Homberger, J. (2007). A multi-agent system for the decentralized resource-constrained multi-project scheduling problem. International Transactions in Operational Research, 14(6), 565–589. doi:10.1111/j.1475-3995.2007.00614.x
   Google Scholar
• Kaplan, L. (1998). Resource-constrained project scheduling with preemption of jobs (Unpublished PhD dissertation). University of Michigan.
   Google Scholar
• Kolisch, R. (2015). Shifts, types, and generation schemes for project schedules (Vol. 1; C. Schwindt & J. Zimmermann, Eds.). Berlin, Germany: Springer International Publishing.
   Google Scholar
• Kolisch, R., & Sprecher, A. (1997). PSPLIB - A project scheduling problem library. European Journal of Operational Research, 96 (1), 205–216. doi:10.1016/S0377-2217(96)00170-1
   Web of Science ®Google Scholar
• Koné, O., Artigues, C., Lopez, P., & Mongeau, M. (2011). Event-based MILP models for resource-constrained project scheduling problems. Computers and Operations Research, 38(1), 3–13. doi:10.1016/j.cor.2009.12.011
   Web of Science ®Google Scholar
• Kopanos, G. M., Kyriakidis, T. S., & Georgiadis, M. C. (2014). New continuous-time and discrete-time mathematical formulation for resource-constrained project scheduling problems. Computers and Chemical Engineering, 68, 96–106. doi:10.1016/j.compchemeng.2014.05.009
   Web of Science ®Google Scholar
• Kovács, A., & Váncza, J. (2006). Progressive solutions: A simple but efficient dominance rule for practical RCPSP. In J. Christopher Beck, and Barbara M. Smith (Eds.), Integration of AI and or techniques in constraint programming for combinatorial optimization problems (pp. 139–151). Berlin, Heidelberg: Springer.
   Google Scholar
• Kovács, A., & Váncza, J. (2010). Exploiting repetitive patterns in practical scheduling problems. In 43rd CIRP International Conference on Manufacturing Systems (pp. 868–875). Vienna: NWV Neuer Wissenschaftlicher Verlag, c201.
   Google Scholar
• Kreter, S., Schutt, A., & Stuckey, P. J. (2017). Using constraint programming for solving RCPSP/max-cal. Constraints, 22(3), 432–462. doi:10.1007/s10601-016-9266-6
   Web of Science ®Google Scholar
• Laborie, P. (2003). Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence, 143(2), 151–188. doi:10.1016/S0004-3702(02)00362-4
   Web of Science ®Google Scholar
• Laborie, P. (2009). IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. Lecture Notes in Computer Science, 5547, 148–162.
   Google Scholar
• Laborie, P., Rogerie, J., Shaw, P., & Vilím, P. (2018). IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM/ILOG. Constraints, 23(2), 210–250. doi:10.1007/s10601-018-9281-x
   Web of Science ®Google Scholar
• Luby, M., Sinclair, A., & Zuckerman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47 (4), 173–180. doi:10.1016/0020-0190(93)90029-9
   Web of Science ®Google Scholar
• Masin, M., & Raviv, T. (2014). Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem. Journal of Scheduling, 17 (4), 321–338. doi:10.1007/s10951-014-0376-y
   Web of Science ®Google Scholar
• Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001), Las Vegas, NV, USA, (pp. 530–535). doi:10.1145/378239.379017
   Google Scholar
• Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J., & Tack, G. (2007). MiniZ-inc: Towards a Standard CP Modelling Language. Principles and Practice of Constraint Programming CP, 2007, 529–543.
   Google Scholar
• Neumann, K., & Zhan, J. (1995). Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints. Journal of Intelligent Manufacturing, 6(2), 145–154. doi:10.1007/BF00123686
   Web of Science ®Google Scholar
• Ohrimenko, O., Stuckey, P. J., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14 (3), 357–391. doi:10.1007/s10601-008-9064-x
   Web of Science ®Google Scholar
• Pritsker, A. A. B., Waiters, L. J., & Wolfe, P. M. (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16(1), 93–108. doi:10.1287/mnsc.16.1.93
   Web of Science ®Google Scholar
• Sankaran, J. K., Bricker, D. L., & Juang, S. H. (1999). Strong fractional cutting-plane algorithm for resource-constrained project scheduling. International Journal of Industrial Engineering: Theory Applications and Practice, 6(2), 99–111.
   Web of Science ®Google Scholar
• Schutt, A., Feydy, T., & Stuckey, P. J. (2013). Scheduling optional tasks with explanation. Lecture Notes in Computer Science, 8124, 628–644.
   Google Scholar
• Schutt, A., Feydy, T., Stuckey, P. J., & Wallace, M. G. (2011). Explaining the cumulative propagator. Constraints, 16(3), 250–282. doi:10.1007/s10601-010-9103-2
   Web of Science ®Google Scholar
• Schutt, A., Feydy, T., Stuckey, P. J., & Wallace, M. G. (2013). Solving RCPSP/max by lazy clause generation. Journal of Scheduling, 16(3), 273–289. doi:10.1007/s10951-012-0285-x
   Web of Science ®Google Scholar
• Schutt, A., & Stuckey, P. J. (2016). Explaining producer/consumer constraints. In M. Rueher (Ed.), Principles and practice of constraint programming: 22nd International Conference (pp. 438–454). Springer International Publishing.
   Google Scholar
• Schwindt, C., & Zimmermann, J. (2015a). Handbook on project management and scheduling (Vol. 1). Springer International Publishing.
   Google Scholar
• Schwindt, C., & Zimmermann, J. (2015b). Handbook on project management and scheduling (Vol. 2). Springer International Publishing.
   Google Scholar
• Tesch, A. (2016). Compact models for the resource-constrained project scheduling problem (Vol. ZIB report) (Unpublished doctoral dissertation). Technische Universitat Berlin.
   Google Scholar
• Tesch, A. (2018). Improved CompactModels for the resource-constrained project scheduling problem. In A. Fink, A. Fugenschuh, and M. J. Geiger (Eds.) Operations Research Proceedings, 25–30. (pp. 25–30). Cham: Springer.
   Google Scholar
• Toffolo, T. A., Santos, H. G., Carvalho, M. A., & Soares, J. A. (2016). An integer programming approach to the multimode resource-constrained multiproject scheduling problem. Journal of Scheduling, 19 (3), 295–307. doi:10.1007/s10951-015-0422-4
   Web of Science ®Google Scholar
• Van Der Veen, J. A. A., & Zhang, S. (1996). Low-complexity algorithms for sequencing jobs with a xed number of job-classes. Computers & Operations Research, 23 (11), 1059–1067. doi:10.1016/0305-0548(96)00016-0
   Web of Science ®Google Scholar
• Verma, S., & Dessouky, M. (1999). Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines. Journal of Scheduling, 2(3), 135–150. doi:10.1002/(SICI)1099-1425(199905/06)2:3<135::AID-JOS21>3.3.CO;2-C
   Google Scholar
• Vilím, P. (2009). Edge finding filtering algorithm for discrete cumulative resources. In International conference on AI and OR techniques in constraint programming for combinational optimization problems (pp. 802–816). Berlin, Heidelberg: Springer. http://link.springer.com/chapter/10.1007/978-3-642-04244-7_62
   Google Scholar
• Vilim, P., Laborie, P., & Shaw, P. (2015). Failure-directed search for constraint-based scheduling. Presented at Integration of AI and OR Techniques in Constraint Programming: 12th International Conference, CPAIOR 2015 (pp. 437–453), Barcelona, Spain, May 18–22, 2015.
   Google Scholar
• Voß, S., & Witt, A. (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. doi:10.1016/j.ijpe.2004.05.029
   Web of Science ®Google Scholar