MIP formulations for the resource loading problem

Song Guopeng and Roel Leus

No 626339, Working Papers of Department of Decision Sciences and Information Management, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven

Abstract: We study the resource loading problem, which arises in tactical capacity planning. It depicts a sketch of the usage of resources, and decides the execution intensity for the orders to be executed. We study various MIP formulations for this problem, including three time-indexed formulations and one based on Dantzig-Wolfe decomposition. The relaxation strength of the formulations is compared based on polyhedral analysis. Computational experiments for these formulations are also presented, showing their difference in performance for finding optimal integer solutions.

Keywords: Capacity planning; Mixed integer programming; Time-indexed formulation; Dantzig-Wolfe decomposition; LP-relaxation (search for similar items in EconPapers)
Pages: 18
Date: 2018
New Economics Papers: this item is included in nep-cmp
Note: paper number KBI_1808
References: Add references at CitEc
Citations:

Published in FEB Research Report KBI_1808

Downloads: (external link)
https://lirias.kuleuven.be/retrieve/515281 Published version (application/pdf)

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:ete:kbiper:626339

Access Statistics for this paper

More papers in Working Papers of Department of Decision Sciences and Information Management, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven
Bibliographic data for series maintained by library EBIB ().