Abstract
We study the problem of allocating a limited quantity of a single manufacturing resource to produce a subset of possible part-types. Customer orders require one or more part-types. We assume that revenue is received for an order only if it is completely filled, and that set-up costs and order revenues dominate the variable costs of production. We present a heuristic for the solution of our problem, as well as families of cutting-planes for an integer programming formulation. Computational results on a set of random test problems indicate that the heuristic is quite effective in producing near optimal solutions. The cutting-planes appear to be quite useful in reducing the number of linear programming solutions required by branch-and-bound.
Similar content being viewed by others
References
B.L. Dietrich, L. Escudero and F. Chance, Efficient reformulation methods for 0–1 programs: Methods and computational results, IBM Research, T.J. Watson Research Center, Yorktown Heights, NY (1990).
H. Crowder, E. Johnson and M. Padberg, Solving large-scale zero—one linear programming problems, Oper. Res. 31(1983)803–834.
B.L. Dietrich and L.F. Escudero, Some efficient reformulation methods for 0–1 programs, RC-15897, IBM Research, T.J. Watson Research Center, Yorktown Heights, NY (1990).
J. Edmonds and D.R. Fulkerson, Bottleneck extrema, J. Combin. Theory 8(1970)299–306.
M. Fischetti, S. Martello and P. Toth, The fixed job schedule problem with working-time constraints, Oper. Res. 37(1989)395–403.
M.L. Fisher and L.A. Wolsey, On the greedy heuristic for covering and packing problems, SIAM J. Alg. Discr. Meth. 3(1982)584–591.
K. Hoffman and M.W. Padberg, LP-based combinatorial problem solving, Ann. Oper. Res. 4(1985)145–194.
F. Kianfar, Stronger inequalities for 0–1 integer programming: Computational refinements, Oper. Res. 24(1976)581–585.
J.M. Mulvey and M.P. Beck, Solving capacitated clustering problems, Eur. J. Oper. Res. 18(1984)339–348.
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, 1988).
E. Zemel, Easily computable facets of the knapsack polytope, Math. Oper. Res. 14(1989)760–764.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dietrich, B.L., Lee, J. & Lee, Y.S. Order selection on a single machine with high set-up costs. Ann Oper Res 43, 379–396 (1993). https://doi.org/10.1007/BF02024936
Issue Date:
DOI: https://doi.org/10.1007/BF02024936