Valid inequalities for a class of assembly system problems

DOI10.1016/S0377-2217(99)00278-7MaRDI QIDQ1584810zbMATH OpenFDO

Authors Anulark Pinnoi, Wilbert E. Wilhelm

Publication date 5 November 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00278-7

zbMATH Keywords

assembly system designbranch-and-cutcutting planeinteger programmingnode packing problemsoptimizationworkload smoothing

Mathematics Subject Classification ID

Operations research and management science (90B99) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Assembly system design: A branch and cut approach
• A Branch and Cut Approach for Workload Smoothing on Assembly Lines
• A strong cutting plane algorithm for the robotic assembly line balancing problem
• A family of hierarchical models for the design of deterministic assembly systems
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem

Cites work

• A Branch and Cut Approach for Workload Smoothing on Assembly Lines
• A family of hierarchical models for the design of deterministic assembly systems
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• An Integer Programming Procedure for Assembly System Design Problems
• Assembly system design: A branch and cut approach
• Assembly-Line Balancing by Linear Programming
• Covering, Packing and Knapsack Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Solving Large-Scale Zero-One Linear Programming Problems
• Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

Cited in

(6)

• A branch-and-cut algorithm for an assembly routing problem
• Assembly system design: A branch and cut approach
• A branch-and-cut approach for a generic multiple-product, assembly-system design problem
• A family of hierarchical models for the design of deterministic assembly systems
• A strong cutting plane algorithm for the robotic assembly line balancing problem
• A cutting plane approach for the single-product assembly system design problem

This page was built for publication: Valid inequalities for a class of assembly system problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584810)