Abstract
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we consider a specific instance of such a problem: planning efficient utilization of the facilities and technicians that maintain the United States nuclear stockpile. A detailed study of this problem yields a complicated mixed-integer programming (MIP) model with upward of hundreds of thousands of variables and even more constraints. Consistently and quickly solving such a model exactly is impossible using today’s algorithms and computers, and, in addition to branch-and-bound, requires good heuristics and approximation algorithms. In an effort to design such algorithms, we study several different methods of generating good solutions given the solution to the LP relaxation. We design a suite of sample data and test the algorithms.
The goals of this project were twofold. First, we wanted to develop a program that could efficiently and accurately help with the Pantex planning problem. Second, we wanted to experimentally test various ideas, designed originally for “cleaner” problems, in this more challenging context. In summary, we demonstrate the value of using α-points as a way to quickly and cheaply generate, from one solution of an LP relaxation, many feasible solutions to an integer program. In this particular environment, the use of α-points, combined with other heuristics, outperforms local search. We also see the value of finding combinatorially-structured subproblems as opposed to using simple greedy approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resourceconstrained project scheduling: Notation, classification, models, and methods. European Journal on Operations Research 112, 3–41 (1999)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill (2001)
Eckstein, J., Phillips, C.A., Hart, W.E.: PICO: an objectoriented framework for parallel branch and bound. In: Inherently parallel algorithms in feasibility and optimization and their applications (Haifa, 2000). Stud. Comput. Math, vol. 8, pp. 219–265. North-Holland, Amsterdam (2001)
Goemans, M.: Improved approximation algorithms for scheduling with release dates. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 591–598 (1997)
Goemans, M.X., Queyranne, M., Schulz, A.S., Skutella, M., Wang, Y.: Single machine scheduling with release dates. SIAM J. Discrete Math. 15(2), 165–192 (2002)
Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513–544 (1997)
Kjeldgaard, E.A., Jones, D.A., List, G.F., Turnquist, M.A., Angelo, J.W., Hopson, R.D., Hudson, J., Holeman, T.: Swords into plowshares: Nuclear weapon dismantlement, evaluation, and maintenance at pantex. Interfaces 30(1), 57–82 (2000)
Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows and a precendece constrained single machine scheduling problem. talk by M. Queyranne at IMPS (1997)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6, 1–12 (1959)
Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M.: Resource-constrained project scheduling: computing lower bounds by solving minimum cut problems. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 139–150. Springer, Heidelberg (1999)
Neumann, K., Zimmermann, J.: Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. European Journal on Operations Research 127, 425–443 (2000)
Phillips, C.A., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. Journal of Scheduling 3(6), 365–382 (2000)
Savelsbergh, M.W.P., Uma, R.N., Wein, J.: An experimental study of LP-based scheduling heuristics. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 453–461 (1998)
Schulz, S., Skutella, M.: Scheduling–LPs bear probabilities: Randomized approximations for min–sum criteria. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284, pp. 416–429. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asgeirsson, E., Berry, J., Phillips, C.A., Phillips, D.J., Stein, C., Wein, J. (2004). Scheduling an Industrial Production Facility. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive