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

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.

[1]  Heather Reed.  Wartime Sourcing: Building Capability and Predictability through Continuity , 2011 .

[2]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[3]  Gintaras Palubeckis.  On the recursive largest first algorithm for graph colouring , 2008, Int. J. Comput. Math..

[4]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5]  K. Mckinzie,et al.  A review of strategic mobility models supporting the defense transportation system , 2004 .

[6]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[7]  Kenneth H. Rosen.  Elementary Number Theory: And Its Applications , 2010 .

[8]  David W. Hughes,et al.  ARFORGEN BOG: Dwell Simulation , 2011 .

[9]  Timothy M. Bonds,et al.  Army Deployments to Oif and Oef , 2010 .

[10]  Erik Demeulemeester,et al.  Personnel scheduling: A literature review , 2013, Eur. J. Oper. Res..

[11]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[12]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..

[13]  H. A. Kierstead,et al.  The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..

[14]  Douglas A. Ollivant,et al.  Producing Victory: Rethinking Conventional Forces in COIN Operations , 2006 .

[15]  Steven M. Aviles.  Scheduling Army Deployments To Two Nearly Simultaneous Major Regional Conflicts. , 1995 .

[16]  Ivo Blöchliger,et al.  Modeling staff scheduling problems. A tutorial , 2004, Eur. J. Oper. Res..

[17]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[18]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[19]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[20]  Vahid Lotfi,et al.  A graph coloring algorithm for large scale scheduling problems , 1986, Comput. Oper. Res..

[21]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[22]  David J. Kilcullen.  "Twenty-Eight Articles": Fundamentals of Company-Level Counterinsurgency , 2006 .

[23]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[24]  Michel Gamache,et al.  A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding , 2007, Comput. Oper. Res..

[25]  Thom J. Hodgson,et al.  The deployment scheduling analysis tool (DSAT) , 2004 .

[26]  Jun Qin,et al.  Coloring interval graphs with first-fit , 1995, Discret. Math..

[27]  Alain Hertz,et al.  Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.

[28]  Hesham K. Alfares,et al.  Survey, Categorization, and Comparison of Recent Tour Scheduling Literature , 2004, Ann. Oper. Res..

[29]  Frédéric Cazals,et al.  A note on the problem of reporting maximal cliques , 2008, Theor. Comput. Sci..