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 条
[21]  
Hughes David W., 2011, ARFORGEN BOG DWELL S
[22]  
Kierstead H.A., 1988, SIAM J DISCRETE MATH, V1, P526
[23]   COLORING INTERVAL-GRAPHS WITH FIRST-FIT [J].
KIERSTEAD, HA ;
QIN, J .
DISCRETE MATHEMATICS, 1995, 144 (1-3) :47-57
[24]  
Kilcullen D., 2006, MIL REV, V86, P50
[25]   GRAPH-COLORING ALGORITHM FOR LARGE SCHEDULING PROBLEMS [J].
LEIGHTON, FT .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1979, 84 (06) :489-506
[26]   A survey on vertex coloring problems [J].
Malaguti, Enrico ;
Toth, Paolo .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2010, 17 (01) :1-34
[27]   Survey of multi-objective optimization methods for engineering [J].
Marler, RT ;
Arora, JS .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2004, 26 (06) :369-395
[28]  
McKinzie K, 2004, MATH COMPUT MODEL, V39, P839, DOI [10.1016/S0895-7177(04)90557-2, 10.1016/j.mcm.2004.02.017]
[30]  
Reed Heather, 2011, MILITARY REV