Authors: Casey D. Trail; Mendel D. Schmiedekamp; Shashi Phoha; John P. Sustersic
Addresses: Technomics, Inc. 201 12th Street, South, Suite 612, Arlington, VA 22202, USA. ' Remcom, Inc., 315 South Allen Street, Suite 416, State College, PA 16801, USA. ' The Pennsylvania State University, 217 Applied Science Building, University Park, PA 16802, USA. ' The Pennsylvania State University, 217 Applied Science Building, University Park, PA 16802, USA
Abstract: Near-optimal scheduling and allocation for DoD missions is complicated by many factors, including multiple measures of effectiveness, mixed-initiatives, heterogeneity of systems and non-uniformity of homogenous systems; these factors contribute to a complex planning problem with non-linear, combinatorial, and continuous components that is further complicated by information uncertainty. In Navy, mine counter measure missions, planning entails components of the vehicle routing problem with time windows and flexible flowshop scheduling with pre-emptive maintenance. We present a multiobjective mine counter measures problem formulation and describe the non-dominated scheduler, a scheduling programme that parametrically explores continuous dimensions of the decision space, stochastically samples from exponentially large decision spaces, and uses surrogate metrics to bound computational complexity. This provides mission commander with a non-dominated set of alternative plans. This scheduler has been integrated into existing tools and is being evaluated by the US Navy for extension and integration into next-generation mine warfare decision aids.
Keywords: multiobjective optimisation; mixed integer nonlinear programming; mission planning; heuristics; hierarchical optimisation; multiobjective planning; naval mines; mine countermeasures; vehicle routing problem; time windows; flexible flow shops; flow shop scheduling; pre-emptive maintenance; US Navy; next-generation mine warfare; decision aids.
International Journal of Operational Research, 2013 Vol.16 No.1, pp.113 - 135
Published online: 01 Nov 2012 *Full-text access for editors Access for subscribers Purchase this article Comment on this article