.png){kind=icon}
.png){kind=icon}
Return
Minimum cost multi-product flow lines
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-006-0151-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the problem of finding the minimum cost flow line able to produce different products is considered. This problem can be formulated as a shortest path problem on an acyclic di-graph when the machines graph associated with each product family is a chain or a comb. These graphs are relevant in production planning when dealing with pipelined assembly systems. We solve the problem using A* algorithm which can be efficiently exploited when there is a good estimate on the value of an optimal solution. Therefore, we adapt a known bound for the Shortest Common Supersequence problem to our case and show the effectiveness of the approach by presenting an extensive computational experience.
Keywords:
flow lines optimization
shortest path algorithms
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available