Home > Research > Publications & Outputs > Dynamic resource allocation

Links

Text available via DOI:

View graph of relations

Dynamic resource allocation: a flexible and tractable modeling framework

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Dynamic resource allocation: a flexible and tractable modeling framework. / Bertsimas, Dimitris; Gupta, Shubham; Lulli, Guglielmo.
In: European Journal of Operational Research, Vol. 236, No. 1, 01.07.2014, p. 14-26.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Bertsimas, D, Gupta, S & Lulli, G 2014, 'Dynamic resource allocation: a flexible and tractable modeling framework', European Journal of Operational Research, vol. 236, no. 1, pp. 14-26. https://doi.org/10.1016/j.ejor.2013.10.063

APA

Bertsimas, D., Gupta, S., & Lulli, G. (2014). Dynamic resource allocation: a flexible and tractable modeling framework. European Journal of Operational Research, 236(1), 14-26. https://doi.org/10.1016/j.ejor.2013.10.063

Vancouver

Bertsimas D, Gupta S, Lulli G. Dynamic resource allocation: a flexible and tractable modeling framework. European Journal of Operational Research. 2014 Jul 1;236(1):14-26. doi: 10.1016/j.ejor.2013.10.063

Author

Bertsimas, Dimitris ; Gupta, Shubham ; Lulli, Guglielmo. / Dynamic resource allocation : a flexible and tractable modeling framework. In: European Journal of Operational Research. 2014 ; Vol. 236, No. 1. pp. 14-26.

Bibtex

@article{59ea8152ef564f608bdc7afaa7dfb498,
title = "Dynamic resource allocation: a flexible and tractable modeling framework",
abstract = "This paper presents a binary optimization framework for modeling dynamic resource allocation problems. The framework (a) allows modeling flexibility by incorporating different objective functions, alternative sets of resources and fairness controls; (b) is widely applicable in a variety of problems in transportation, services and engineering; and (c) is tractable, i.e.; provides near optimal solutions fast for large-scale instances. To justify these assertions, we model and report encouraging computational results on three widely studied problems - the Air Traffic Flow Management, the Aircraft Maintenance Problems and Job Shop Scheduling. Finally, we provide several polyhedral results that offer insights on its effectiveness.",
keywords = "Applications of integer optimization, Fairness, Resource allocation, Scheduling",
author = "Dimitris Bertsimas and Shubham Gupta and Guglielmo Lulli",
year = "2014",
month = jul,
day = "1",
doi = "10.1016/j.ejor.2013.10.063",
language = "English",
volume = "236",
pages = "14--26",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "1",

}

RIS

TY - JOUR

T1 - Dynamic resource allocation

T2 - a flexible and tractable modeling framework

AU - Bertsimas, Dimitris

AU - Gupta, Shubham

AU - Lulli, Guglielmo

PY - 2014/7/1

Y1 - 2014/7/1

N2 - This paper presents a binary optimization framework for modeling dynamic resource allocation problems. The framework (a) allows modeling flexibility by incorporating different objective functions, alternative sets of resources and fairness controls; (b) is widely applicable in a variety of problems in transportation, services and engineering; and (c) is tractable, i.e.; provides near optimal solutions fast for large-scale instances. To justify these assertions, we model and report encouraging computational results on three widely studied problems - the Air Traffic Flow Management, the Aircraft Maintenance Problems and Job Shop Scheduling. Finally, we provide several polyhedral results that offer insights on its effectiveness.

AB - This paper presents a binary optimization framework for modeling dynamic resource allocation problems. The framework (a) allows modeling flexibility by incorporating different objective functions, alternative sets of resources and fairness controls; (b) is widely applicable in a variety of problems in transportation, services and engineering; and (c) is tractable, i.e.; provides near optimal solutions fast for large-scale instances. To justify these assertions, we model and report encouraging computational results on three widely studied problems - the Air Traffic Flow Management, the Aircraft Maintenance Problems and Job Shop Scheduling. Finally, we provide several polyhedral results that offer insights on its effectiveness.

KW - Applications of integer optimization

KW - Fairness

KW - Resource allocation

KW - Scheduling

U2 - 10.1016/j.ejor.2013.10.063

DO - 10.1016/j.ejor.2013.10.063

M3 - Journal article

AN - SCOPUS:84900467495

VL - 236

SP - 14

EP - 26

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -