A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem
From MaRDI portal
Publication:2890406
DOI10.1287/ijoc.1020.0025zbMath1239.90080OpenAlexW2127099647MaRDI QIDQ2890406
Radu Gadidov, Wilbert E. Wilhelm
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8d1f72b566c600ab6b9b55d7fefd39c87a17ef40
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA ⋮ A classification of assembly line balancing problems ⋮ New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions ⋮ Mixed model line balancing with parallel stations, zoning constraints, and ergonomics ⋮ Minimum cost multi-product flow lines ⋮ \texttt{Absalom}: balancing assembly lines with assignment restrictions
Uses Software
This page was built for publication: A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem
