Minimum cost multi-product flow lines
From MaRDI portal
Publication:2480199
DOI10.1007/s10479-006-0151-3zbMath1144.90363OpenAlexW1999793783MaRDI QIDQ2480199
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0151-3
Programming involving graphs or networks (90C35) Production models (90B30) Deterministic network models in operations research (90B10)
Related Items (2)
Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA ⋮ Parallel dedicated machines scheduling with chain precedence constraints
Cites Work
- Unnamed Item
- Unnamed Item
- The shortest common supersequence problem over binary alphabet is NP- complete
- Theory and algorithms for plan merging
- More on the complexity of common superstring and supersequence problems
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
- A survey on problems and methods in generalized assembly line balancing
- A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem
- Optimal Investment in Product-Flexible Manufacturing Capacity
- Linear Algorithm for Data Compression via String Matching
- The Complexity of Some Problems on Subsequences and Supersequences
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
This page was built for publication: Minimum cost multi-product flow lines