Order selection on a single machine with high set-up costs
- 1 July 1993
- journal article
- section vii-industrial-scheduling
- Published by Springer Nature in Annals of Operations Research
- Vol. 43 (7) , 379-396
- https://doi.org/10.1007/bf02024936
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Easily Computable Facets of the Knapsack PolytopeMathematics of Operations Research, 1989
- The Fixed Job Schedule Problem with Working-Time ConstraintsOperations Research, 1989
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- Lp-based combinatorial problem solvingAnnals of Operations Research, 1985
- Solving capacitated clustering problemsEuropean Journal of Operational Research, 1984
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- On the Greedy Heuristic for Continuous Covering and Packing ProblemsSIAM Journal on Algebraic Discrete Methods, 1982
- Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational RefinementsOperations Research, 1976
- Bottleneck extremaJournal of Combinatorial Theory, 1970