Computational analysis of a flexible assembly system design problem

DOI10.1016/S0377-2217(99)00104-6zbMath0991.90052OpenAlexW1988722358MaRDI QIDQ1572965

Edward C. Sewell, Ashok Kumar, Jacobson, Sheldon H.

Publication date: 6 August 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)00104-6

zbMATH Keywords

complexityheuristicsflexible manufacturing systemsbranch-and-boundexact algorithmcomputational analysisflexible assembly systemslower bound algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• Algorithm 97

Cites Work

• On queueing network models of flexible manufacturing systems
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• A multiple criteria decision making approach for the assembly line balancing problem
• A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational analysis of a flexible assembly system design problem