A graph coloring approach to the deployment scheduling and unit assignment problem

被引:3
作者
Zais, Mark [1 ]
Laguna, Manuel [1 ]
机构
[1] Univ Colorado, Boulder, CO 80309 USA
关键词
Graph coloring; Interval graph; Optimization; Scheduling; Metaheuristics; ALGORITHM;
D O I
10.1007/s10951-015-0434-0
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We address one of the external factors of personnel inventory behavior, deployments. The configuration of persistent unit deployments has the ability to affect everything from individual perceptions of service palatability to operational effectiveness. There is little evidence to suggest any analytical underpinnings to the U.S. Army deployment scheduling and unit assignment patterns. This paper shows that the deployment scheduling and unit assignment problem can be formulated as an interval graph such that modifications to traditional graph coloring algorithms provide an efficient mechanism for dealing with multiple objectives.
引用
收藏
页码:73 / 90
页数:18
相关论文
共 32 条
[1]  
Alfares H., 2004, ANN OPER RES, V127, P1
[2]  
Aviles StevenM., 1995, SCHEDULING ARMY DEPL
[3]   WORKFORCE ALLOCATION IN CYCLICAL SCHEDULING PROBLEMS - SURVEY [J].
BAKER, KR .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (01) :155-167
[4]   Modeling staff scheduling problems.: A tutorial [J].
Blöchliger, I .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 158 (03) :533-542
[5]  
Bonds T.M., 2010, Army deployments to OIF and OEF
[6]  
Brucker P., 1977, Ann. Discrete Math., V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[7]   A note on the problem of reporting maximal cliques [J].
Calzals, F. ;
Karande, C. .
THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) :564-568
[8]  
CHENG TCE, 1994, J OPER RES SOC, V45, P685, DOI 10.2307/2584459
[9]  
Costa D., 1995, Journal of Heuristics, V1, P105, DOI 10.1007/BF02430368
[10]  
Dabkowski M., 2009, Phalanx: Bulletin of Military Operations Research Related Sciences, V42, P11