Advanced SearchSearch Tips
Study of shortest time artillery position construction plan
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Study of shortest time artillery position construction plan
Ahn, Moon-Il; Choi, In-Chan;
  PDF(new window)
This paper addresses the problem of the construction planning of artillery positions, for which we present an optimization model and propose a heuristic algorithm to solve problems of practical size. The artillery position construction plan includes the assignment of engineers to support the artillery and the schedule of the support team construction sequence. Currently, in the army, managers construct the plan based on their experience. We formulate the problem as a mixed integer program and present a heuristic that utilizes the decomposition of the mixed integer model. We tested the efficacy of the proposed algorithm by conducting computational experiments on both small-size test problems and large-size practical problems. The average optimality gap in the small-size test problem was 6.44% in our experiments. Also, the average computation time to solve the large-size practical problems consisting of more than 200 artillery positions was 79.8 seconds on a personal computer. The result of our computational experiments shows that the proposed approach is a viable option to consider for practical use.
Artillery position;Construction plan;Scheduling;Optimization;Heuristic algorithm;
 Cited by
J. H. Moon and S. H. Lee, "Study on vehicle routing problem of artillery position construction for survivability Support", Journal of the Korean Institute of Industrial Engineers, Vol. 37, No. 3, pp. 171-179, 2011. DOI: crossref(new window)

P. Brucker, "Scheduling Algorithms", p. 1-6, Springer, 1995 DOI:

R. L. Graham, E. L, Lawler, J. K. Lenstra and A. H. G. Rinnooy kan, "Optimization and approximation in deterministic sequencing and scheduling : A survey", Annals of Discrete Mathematics 5, pp.287-326, 1979. DOI: crossref(new window)

J. Blazewicz, M. Dror and J. Weglarz, "Mathematical programming formulations for machine scheduling : A survey", European Journal of Operational Research 51, pp. 283-300, 2003. DOI: crossref(new window)

A. S. Manne, "On the Job-shop scheduling problem", Operations Research, Vol. 8, No. 2, pp. 219-223, 1960. DOI: crossref(new window)

D. S Choi and I. C. Choi, "A local search algorithm for jobhop scheduling problems with alternative operations and sequence-dependent setups", Computers&Industrial Engineering 42, pp. 43-58, 2002. DOI: crossref(new window)

S. Hartmann, D. Briskorn, "A survey of variants and extensions of the resource-constrained project scheduling problem", European Journal of Operational Research 207, pp. 1-14, 2010. DOI: crossref(new window)

P. Brucker, A. Drexl, R. Mohring, K. Neumann and E. Pesch, "Resource-constrained project scheduling : Notation, classification, models, and methods", European Journal of Operational Research 112, pp. 3-41, 1999. DOI: crossref(new window)

E. Mokotoff, "Parallel machine scheduling problems : A survey", Asia-Pacific Journal of Operational Research 18.2, pp. 193-242, 2001.

E. L. Lawler and J. Labetoulle, "On preemptive scheduling of unrelated parallel processors by linear programming", Journal of the Association for Computing Machinery 25, pp. 612-619, 1978. DOI: crossref(new window)