Dynamic resource allocation: A flexible and tractable modeling framework

被引:38
作者
Bertsimas, Dimitris [1 ]
Gupta, Shubham [1 ]
Lulli, Guglielmo [2 ]
机构
[1] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
[2] Univ Milano Bicocca, Dept Informat Syst & Commun, I-20126 Milan, Italy
关键词
Applications of integer optimization; Resource allocation; Scheduling; Fairness; SHIFTING BOTTLENECK; SHOP; FORMULATIONS; ALGORITHMS; BRANCH;
D O I
10.1016/j.ejor.2013.10.063
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:14 / 26
页数:13
相关论文
共 34 条
[1]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[2]   A unified resource scheduling framework for heterogeneous computing environments [J].
Alhusaini, AH ;
Prasanna, VK ;
Raghavendra, CS .
(HCW '99) - EIGHTH HETEROGENEOUS COMPUTING WORKSHOP, PROCEEDINGS, 1999, :156-165
[3]  
Amouzegar M.A., 2002, RB82RF RAND
[4]   Multiairport ground holding problem: A computational evaluation of exact algorithms [J].
Andreatta, G ;
Brunetta, L .
OPERATIONS RESEARCH, 1998, 46 (01) :57-64
[5]  
[Anonymous], 2003, Linear programming 2: theory and extensions
[6]  
Applegate D., 1991, ORSA Journal on Computing, V3, P149, DOI 10.1287/ijoc.3.2.149
[7]   Guided local search with shifting bottleneck for job shop scheduling [J].
Balas, E ;
Vazacopoulos, A .
MANAGEMENT SCIENCE, 1998, 44 (02) :262-275
[8]   A unified approach to approximating resource allocation and scheduling [J].
Bar-Noy, A ;
Bar-Yehuda, R ;
Freund, A ;
Naor, J ;
Schieber, B .
JOURNAL OF THE ACM, 2001, 48 (05) :1069-1090
[9]   The air traffic flow management problem with enroute capacities [J].
Bertsimas, D ;
Patterson, SS .
OPERATIONS RESEARCH, 1998, 46 (03) :406-422
[10]  
Bertsimas D., 1997, TECHNICAL REPORT