×
Claassen, G. D. H.; van Beek, P.

Planning and scheduling packaging lines in food industry. (English) Zbl 0800.90652

Eur. J. Oper. Res. 70, No. 2, 150-158 (1993).

Cited in 4 Documents

MSC:

90B90 Case-oriented studies in operations research
90B35 Deterministic scheduling theory in operations research
90C11 Mixed integer programming
90B80 Discrete location and assignment
Cite Review PDF
Full Text: DOI

References:

[1] Anthony, R. N., Planning and control systems: A framework for analysis (1965), Graduate School of Business Administration, Harvard University
[2] Cornuejols, G.; Sridharan, R.; Thizy, J. M., A comparison of heuristics and relaxations for the capacitated plant location problem, European Journal of Operational Research, 50, 280-297 (1991) · Zbl 0734.90046
[3] Erlenkotter, D., A dual-based procedure for uncapacitated facility location, Operations Research, 26, 992-1009 (1978) · Zbl 0422.90053
[4] Garey, M. R.; Johnson, D. S.; Sethi, R., Complexity of flow shop and job shop scheduling, Mathematics of Operations Research, 1, 2, 117-129 (1976) · Zbl 0396.90041
[5] Hax, A. C.; Candea, D., Production and Inventory Management (1984), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ
[6] Roy, T. J.van, A cross decomposition algorithm for capacitated facility location, Operations Research, 34, 1, 145-163 (1984) · Zbl 0594.90022
[7] Schrage, L., Implicit representation of variable upper bounds in linear programming, Mathematical Programming Study, 4, 118-132 (1975) · Zbl 0359.90049
[8] Wassenhove, L. N.van; Vanderhenst, P., Planning production in a bottleneck department, European Journal of Operational Research, 12, 127-137 (1983)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.