Order selection on a single machine with high set-up costs

DOI10.1007/BF02024936zbMath0797.90035MaRDI QIDQ1309884

Brenda L. Dietrich, Jon Lee, Thomas Yew Sing Lee

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

production schedulinglower boundsheuristiccutting planesbranch-and-cutinteger linear program

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

A column generation approach to job grouping for flexible manufacturing systems, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, Combinatorial optimization models for production scheduling in automated manufacturing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• Efficient reformulation for 0-1 programs -- methods and computational results
• Easily Computable Facets of the Knapsack Polytope
• Solving Large-Scale Zero-One Linear Programming Problems
• The Fixed Job Schedule Problem with Working-Time Constraints
• Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements
• On the Greedy Heuristic for Continuous Covering and Packing Problems
• Bottleneck extrema