Mixed-Integer Linear Programming Formulations
Christian Artigues (),
Oumar Koné (),
Pierre Lopez () and
Marcel Mongeau ()
Additional contact information
Christian Artigues: Univ de Toulouse
Oumar Koné: Université Nangui Abrogoua
Pierre Lopez: Univ de Toulouse
Marcel Mongeau: lab MAIAA, ENAC
Chapter Chapter 2 in Handbook on Project Management and Scheduling Vol.1, 2015, pp 17-41 from Springer
Abstract:
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.
Keywords: Makespan minimization; Mixed-integer linear programming formulations; Project scheduling; Resource constraints (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (13)
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:ihichp:978-3-319-05443-8_2
Ordering information: This item can be ordered from
http://www.springer.com/9783319054438
DOI: 10.1007/978-3-319-05443-8_2
Access Statistics for this chapter
More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().