Minimum cost multi-product flow lines |
| |
Authors: | Arianna Alfieri Gaia Nicosia |
| |
Institution: | (1) Politecnico di Torino, Dipt. Sistemi di Produzione ed Economia, Corso Duca degli Abruzzi 24, 10129 Torino, Italy;(2) Dipartimento di Informatica e Automazione, Università “Roma Tre”, Via della Vasca Navale 79, 00146 Rome, Italy |
| |
Abstract: | 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 |
本文献已被 SpringerLink 等数据库收录! |
|