IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v150y2007i1p31-4610.1007-s10479-006-0151-3.html
   My bibliography  Save this article

Minimum cost multi-product flow lines

Author

Listed:
  • Arianna Alfieri
  • Gaia Nicosia

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. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Arianna Alfieri & Gaia Nicosia, 2007. "Minimum cost multi-product flow lines," Annals of Operations Research, Springer, vol. 150(1), pages 31-46, March.
    • Handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:31-46:10.1007/s10479-006-0151-3
    DOI: 10.1007/s10479-006-0151-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0151-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0151-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter A. Pinto & David G. Dannenbring & Basheer M. Khumawala, 1983. "Assembly Line Balancing with Processing Alternatives: An Application," Management Science, INFORMS, vol. 29(7), pages 817-830, July.
    2. Wilbert E. Wilhelm & Radu Gadidov, 2004. "A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 39-55, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agnetis, Alessandro & Kellerer, Hans & Nicosia, Gaia & Pacifici, Andrea, 2012. "Parallel dedicated machines scheduling with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 221(2), pages 296-305.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2007. "A classification of assembly line balancing problems," European Journal of Operational Research, Elsevier, vol. 183(2), pages 674-693, December.
    2. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    3. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    4. Armin Scholl & Nils Boysen & Malte Fliedner, 2009. "Optimally solving the alternative subgraphs assembly line balancing problem," Annals of Operations Research, Springer, vol. 172(1), pages 243-258, November.
    5. Wilbert E. Wilhelm & Radu Gadidov, 2004. "A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 39-55, February.
    6. Anulark Pinnoi & Wilbert E. Wilhelm, 1998. "Assembly System Design: A Branch and Cut Approach," Management Science, INFORMS, vol. 44(1), pages 103-118, January.
    7. Jonathan Oesterle & Lionel Amodeo & Farouk Yalaoui, 2019. "A comparative study of Multi-Objective Algorithms for the Assembly Line Balancing and Equipment Selection Problem under consideration of Product Design Alternatives," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1021-1046, March.
    8. Gamberi, M. & Gamberini, R. & Manzini, R. & Regattieri, A., 2008. "An analytical model to evaluating the implementation of a batch-production-oriented line," International Journal of Production Economics, Elsevier, vol. 111(2), pages 729-740, February.
    9. Scholl, Armin & Fliedner, Malte & Boysen, Nils, 2010. "Absalom: Balancing assembly lines with assignment restrictions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 688-701, February.
    10. Sotskov, Yuri N. & Dolgui, Alexandre & Portmann, Marie-Claude, 2006. "Stability analysis of an optimal balance for an assembly line with fixed cycle time," European Journal of Operational Research, Elsevier, vol. 168(3), pages 783-797, February.
    11. Hsiu-Hsueh Kao & Din-Horng Yeh & Yi-Hsien Wang, 2011. "Resource Constrained Assembly Line Balancing Problem Solved with Ranked Positional Weight Rule," Review of Economics & Finance, Better Advances Press, Canada, vol. 1, pages 71-80, November.
    12. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2008. "Assembly line balancing: Which model to use when," International Journal of Production Economics, Elsevier, vol. 111(2), pages 509-528, February.
    13. Lopes, Thiago Cantos & Sikora, C.G.S. & Molina, Rafael Gobbi & Schibelbain, Daniel & Rodrigues, L.C.A. & Magatão, Leandro, 2017. "Balancing a robotic spot welding manufacturing line: An industrial case study," European Journal of Operational Research, Elsevier, vol. 263(3), pages 1033-1048.
    14. Pinnoi, Anulark & Wilhelm, Wilbert E., 2000. "Valid inequalities for a class of assembly system problems," European Journal of Operational Research, Elsevier, vol. 126(1), pages 31-50, October.
    15. Araújo, Felipe F.B. & Costa, Alysson M. & Miralles, Cristóbal, 2012. "Two extensions for the ALWABP: Parallel stations and collaborative approach," International Journal of Production Economics, Elsevier, vol. 140(1), pages 483-495.
    16. Jayaswal, Sachin & Agarwal, Prashant, 2013. "Balancing U-Shaped Assembly Lines with Resource Dependent Task Times: A Simulated Annealing Approach," IIMA Working Papers WP2013-11-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:31-46:10.1007/s10479-006-0151-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.