Multiple-facility loading under capacity-based economies of scope

Naval Research Logistics

Volumn 44, Issue 3, 1997, Pages 229-256

  Mazzola, Joseph B ^a   Schantz, Robert H ^b  

^a DUKE UNIVERSITY   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; PLANNING; SCHEDULING;

BRANCH AND BOUND ALGORITHM; CAPACITATED FACILITY LOCATION PROBLEM; CAPACITY BASED ECONOMIES OF SCOPE; COMBINATORIAL OPTIMIZATION; GENERALIZED ASSIGNMENT PROBLEM; MULTIPLE FACILITY LOADING; TABU SEARCH HEURISTIC;

PRODUCTION CONTROL;

EID: 0031121939     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199704)44:3<229::AID-NAV1>3.0.CO;2-A     Document Type: Article

References (43)

1. Akinc, U., and Khumawala, B., "An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem," Management Science, 23, 585-594 (1977).
2. Anderson, S.W., "Measuring the Impact of Product Mix Heterogeneity on Manufacturing Overhead Cost," The Accounting Review, 70, 363-387 (1995).
3. Balas, E., "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research, 13, 517-546 (1965).
4. Balas, E., and Martin, C.H., "Pivot and Complement - A Heuristic for 0-1 Programming," Management Science, 26, 80-96 (1980).
5. Balas, E., and Mazzola, J.B., "Nonlinear 0-1 Programming: I. Linearization Techniques," Mathematical Programming, 30, 1-21 (1984).
6. Balas, E., and Mazzola, J.B., "Nonlinear 0-1 Programming: II. Dominance Relations and Algorithms," Mathematical Programming, 30, 22-45 (1984).
7. Balas, E., and Zemel, E., "An Algorithm for Large 0-1 Knapsack Problems," Operations Research, 28, 1130-1154 (1980).
8. Bitran, G.R., and Gilbert, S.M., "Sequencing Production on Parallel Machines with Two Magnitudes of Sequence-Dependent Setup Costs," Journal of Manufacturing and Operations Management, 3, 24-52 (1990).
9. Bitran, G.R., and Tirupati, D., "Hierarchical Production Planning," in S.C. Graves et al. (Eds.), Handbook in Operations Research and Management Science, Elsevier, Amsterdam, 1993, Vol. 4, pp. 523-568.
10. Cattrysse, D.G., and Van Wassenhove, L.N., "A Survey of Algorithms for the Generalized Assignment Problem," European Journal of Operational Research, 60, 260-272 (1992).
11. Cohen, M.A., and Moon, S., "An Integrated Plant Loading Model with Economies of Scale and Scope," European Journal of Operational Research, 50, 266-279 (1991).
12. Cornuéjols, G., Sridharan, R., and Thizy, J.M., "A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem," European Journal of Operational Research, 50, 280-297 (1991).
13. Crama, Y., and Mazzola, J.B., "Valid Inequalities and Facets for a Hypergraph Model of the Nonlinear Knapsack and the FMS Part Selection Problems," Annals of Operations Research, 58, 99-128 (1995).
14. Daniels, R.L., and Mazzola, J.B., "A Tabu-Search Heuristic for the Flexible-Resource Flow Shop Scheduling Problem," Annals of Operations Research, 41, 207-230 (1993).
15. Davis, P.S., and Ray, T.L., "A Branch-Bound Algorithm for the Capacitated Facilities Location Problem," Naval Research Logistics Quarterly, 16, 331-343 (1969).
16. Geoffrion, A., and Graves, G.W., "Multicommodity Distribution System Design by Benders' Decomposition," Management Science, 20, 828-844 (1974).
17. Geoffrion, A., and McBride, R., "Lagrangean Relaxation Applied to Capacitated Facility Location Problems," AIIE Transactions, 10, 40-47 (1978).
18. Glover, F., "Tabu Search - Part I," ORSA Journal on Computing, 1, 190-206 (1989).
19. Glover, F., "Tabu Search - Part II," ORSA Journal on Computing, 2, 4-32 (1990).
20. Glover, F., Taillard, E., and de Werra, D., "A User's Guide to Tabu Search," Annals of Operations Research, 41, 3-28 (1993).
21. Guignard, M., and Opaswongkarn, K., "Lagrangian Dual Ascent Algorithms for Computing Bounds in Capacitated Plant Location Problems," European Journal of Operational Research, 46, 73-83 (1990).
22. Hammer, P.L., and Rudeanu, S., Boolean Methods in Operations Research and Related Areas, Springer, Berlin, 1968.
23. Hax, A.C., and Meal, H.C., "Hierarchical Integration of Production Planning and Scheduling," in M.A. Geisler (Ed.), Studies in Management Sciences, Volume 1, Logistics, North Holland-American Elsevier, New York, 1975.
24. James, F., "A Review of Pseudorandom Number Generators," Computer Physics Communications, 60, 329-144 (1990).
25. Karwan, K.R., and Mazzola, J.B., "Models for Nonlinear Capacitated Product/Plant Allocation Problems," presented at the 12th International Symposium on Mathematical Programming, Cambridge, MA, 1985.
26. Klastorin, T.D., "An Effective Subgradient Algorithm for the Generalized Assignment Problem," Computers and Operations Research, 6, 155-164 (1979).
27. Lee, C.Y., "An Optimal Algorithm for the Multiproduct Capacitated Facility Location Problem with a Choice of Facility Type," Computers and Operations Research, 18, 167-182 (1991).
28. Marsaglia, G., Zaman, A., and Tsang, W.W., "Toward a Universal Random Number Generator," Statistics and Probability Letters, 9, 35-39 (1990).
29. Martello, S., and Toth, P., "An Algorithm for the Generalized Assignment Problem," in J.P. Brans (Ed.), Operational Research '81, 1981, pp. 589-603.
30. Martello, S., and Toth, P., Knapsack Problems, Algorithms and Computer Implementations, John Wiley and Sons, Chichester, U.K., 1990.
31. Marsten, R.E., "The Design of the XMP Linear Programming Library," ACM Transactions of Mathematical Software, 7, 481-497 (1981).
32. Mazzola, J.B., "Generalized Assignment with Nonlinear Capacity Interaction," Management Science, 35, 923-940 (1989).
33. Mazzola, J.B., and Schantz, R.H., "Single-Facility Resource Allocation Under Capacity-Based Economies and Diseconomies of Scope," Management Science, 41, 669-689 (1995).
34. Mazzola, J.B., and Schantz, R.H., "A Heuristic for Allocating Production of Product Families among Facilities in the Presence of Nonlinear Capacity Interaction," in S. Zionts and J.E. Aronson (Eds.), Operations Research: Methods, Models and Applications: Proceedings of a Conference in Honor of Gerald L. Thompson on the Occasion of His 70th Birthday, Quorum Books, Westport, CT (to appear).
35. Posner, M.E., and Guignard, M., "The 0-1 Collapsing Knapsack Problem," Mathematical Programming, 15, 155-161 (1978).
36. Ross, G.T., and Soland, R.M., "A Branch and Bound Algorithm for the Generalized Assignment Problem," Mathematical Programming, 8, 91-103 (1975).
37. Shafer, S.M., and Ernst, R., "Applying Group Technology Principles Io Warehousing Operations," International Journal of Purchasing and Materials Management, 29, 38-42 (1993).
38. Singh, N., "Design of Cellular Manufacturing Systems: An Invited Review," European Journal of Operational Research, 69, 284-291 (1993).
39. Skinner, W., "The Focused Factory," Harvard Business Review, May-June 1974.
40. Stalk, G., Jr., and Hout, T.M., Competing Against Time: How Time-Based Competition is Reshaping Global Markets, The Free Press, New York, 1990.
41. Stecke, K.E., "Formulation and Solution of Nonlinear Integer Production Planning Problems," Management Science, 29, 273-288 (1983).
42. Taillard, E., "Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem," European Journal of Operational Research, 47, 65-74 (1990).
43. Whitaker, R.A., "Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location," Journal of the Operational Research Society, 36, 61-70 (1985).