Skip to main content
SpringerLink
Log in

Mixed-Integer Linear Programming Formulations

  • Chapter
  • First Online:
Handbook on Project Management and Scheduling Vol.1

Part of the book series: International Handbooks on Information Systems ((INFOSYS))

Abstract

In this chapter, (mixed-)integer linear programming formulations of the resource-constrained project scheduling problem are presented. Standard formulations from the literature and newly proposed formulations are classified according to their size in function of the input data. According to this classification, compact models (of polynomial size), pseudo-polynomial sized models, and formulations of exponential size are presented. A theoretical and experimental comparison of these formulations is then given. The complementarity of the formulations for different usages is finally discussed and directions for future work, such as hybridization with other methods, are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    However, to simplify the presentation, we use set V, which includes the dummy activities, in the formulations.

  2. 2.

    www.om-db.wi.tum.de/psplib/main.html.

References

  • Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391–401

    Article  Google Scholar 

  • Alvarez-Valdés R, Tamarit JM (1993) The project scheduling polyhedron: dimension, facets and lifting theorems. Eur J Oper Res 67:204–220

    Article  Google Scholar 

  • Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149–156

    Article  Google Scholar 

  • Artigues C (2013) A note on time-indexed formulations for the resource-constrained project scheduling problem. Technical Report 13206, LAAS, CNRS, Toulouse

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Artigues C, Demassey S, Néron E (2008) Resource-constrained project scheduling: models, algorithms, extensions and applications. ISTE Ltd, London; Wiley, Hoboken

    Google Scholar 

  • Artigues C, Brucker P, Knust S, Koné O, Lopez P, Mongeau M (2013) A note on “Event-based MILP models for resource-constrained project scheduling problems”. Comp Oper Res 40(4):1060–1063

    Article  Google Scholar 

  • Baptiste P, Demassey S (2004) Tight LP bounds for resource constrained project scheduling. OR Spectr 26(2):251–262

    Article  Google Scholar 

  • Baptiste P, Le Pape C (2000) Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5(1–2):119–39

    Article  Google Scholar 

  • Bianco L, Caramia M (2013) A new formulation for the project scheduling problem under limited resources. Flex Serv Manuf J 25:6–24

    Article  Google Scholar 

  • Brucker P, Knust S (2012) Complex scheduling. Springer, Berlin

    Book  Google Scholar 

  • Cavalcante CCB, de Souza CC, Savelsbergh MWP, Wang Y, Wolsey LA (2001) Scheduling projects with labor constraints. Discrete Appl Math 112(1–3):27–52

    Article  Google Scholar 

  • Christofides N, Alvarez-Valdés R, Tamarit J (1987) Project scheduling with resource constraints: a branch and bound approach. Eur J Oper Res 29:262–273

    Article  Google Scholar 

  • de Souza CC, Wolsey LA (1997) Scheduling projects with labour constraints. Relatório Técnico IC-P7-22. Instituto de Computação, Universidade Estadual de Campinas

    Google Scholar 

  • Demassey S, Artigues C, Michelon P (2005) Constraint propagation-based cutting planes: an application to the resource-constrained project scheduling problem. INFORMS J Comput 17(1):52–65

    Article  Google Scholar 

  • Demeulemeester E, Herroelen W (2002) Project scheduling: a research handbook. Kluwer, Dordrecht

    Google Scholar 

  • Hardin JR, Nemhauser GL and Savelsbergh MW (2008). Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements. Discrete Optim 5(1):19–35

    Article  Google Scholar 

  • Horbach A (2010) A Boolean satisfiability approach to the resource-constrained project scheduling problem. Ann Oper Rer 181:89–107

    Article  Google Scholar 

  • Kaplan LA (1998) Resource-constrained project scheduling with preemption of jobs. Unpublished Ph.D. dissertation, University of Michigan, USA

    Google Scholar 

  • Kimms A (2001) Mathematical programming and financial objectives for scheduling projects. Kluwer, Dordrecht

    Book  Google Scholar 

  • Klein R (2000) Scheduling of resource-constrained projects. Kluwer, Dordrecht

    Book  Google Scholar 

  • Koné O, Artigues C, Lopez P, Mongeau M (2011) Event-based MILP models for resource-constrained project scheduling problems. Comput Oper Res 38(1):3–13

    Article  Google Scholar 

  • Koné O, Artigues C, Lopez P, Mongeau M (2013) Comparison of mixed integer linear programming models for the resource-constrained project scheduling problem with consumption and production of resources. Flex Serv Manuf J 25(1–2):25–47

    Article  Google Scholar 

  • Kyriakidis TS, Kopanos GM, Georgiadis MC (2012) MILP formulations for single- and multi-mode resource-constrained project scheduling problems. Comput Chem Eng 36:369–385

    Article  Google Scholar 

  • Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manage Sci 44:714–729

    Article  Google Scholar 

  • Möhring RH, Schulz AS, Stork F, Uetz M (2001) On project scheduling with irregular starting time costs. Oper Res Lett 28:149–154

    Article  Google Scholar 

  • Mouret S, Grossmann IE, Pestiaux P (2011). Time representations and mathematical models for process scheduling problems. Comput Chem Eng 35(6):1038–1063

    Article  Google Scholar 

  • Pritsker A, Watters L (1968) A zero-one programming approach to scheduling with limited resources. The RAND Corporation, RM-5561-PR

    Google Scholar 

  • Pritsker A, Watters L, Wolfe P (1969) Multi-project scheduling with limited resources: a zero-one programming approach. Manage Sci 16:93–108

    Article  Google Scholar 

  • Queyranne M, Schulz A (1994) Polyhedral approaches to machine scheduling. Technical Report 408/1994, Technische Universität Berlin, Berlin, Germany

    Google Scholar 

  • Sankaran JK, Bricker DL, Juang SH (1999) A strong fractional cutting-plane algorithm for resource-constrained project scheduling. Int J Ind Eng 6(2):99–111

    Google Scholar 

  • Schutt A, Feydy T, Stuckey PJ, Wallace MG (2009) Why cumulative decomposition is not as bad as it sounds. In: Gent IP (ed) Proceedings of principles and practice of constraint programming: CP 2009, Lecture notes in computer science, vol 5732. Springer, Berlin, pp 746–761

    Chapter  Google Scholar 

  • Schutt A, Feydy T, Stuckey PJ, Wallace MG (2011) Explaining the cumulative propagator. Constraints 16(3):250–282

    Article  Google Scholar 

  • Stork F, Uetz M (2005) On the generation of circuits and minimal forbidden sets. Math Prog 102(1):185–203

    Article  Google Scholar 

  • Vanderbeck F (2000). On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper Res 48(1):111–128

    Article  Google Scholar 

  • Zapata JC, Hodge BM, Reklaitis GV (2008) The multimode resource constrained multiproject scheduling problem: alternative formulations. Aiche J 54(8):2111–2119

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LAAS, Univ de Toulouse, Toulouse, France

    Christian Artigues & Pierre Lopez

  2. Laboratoire de Mathématiques et Informatique, Université Nangui Abrogoua, Abidjan, Côte d’Ivoire

    Oumar Koné

  3. lab MAIAA, ENAC, Toulouse, France

    Marcel Mongeau

Authors
  1. Christian Artigues
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oumar Koné
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Lopez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marcel Mongeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Artigues .

Editor information

Editors and Affiliations

  1. Institute of Management and Economics, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

    Christoph Schwindt

  2. Institute of Management and Economics, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

    Jürgen Zimmermann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Artigues, C., Koné, O., Lopez, P., Mongeau, M. (2015). Mixed-Integer Linear Programming Formulations. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol.1. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05443-8_2

Download citation

Publish with us

Policies and ethics

Search

Navigation