IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p379-39710.1023-a1018938608304.html
   My bibliography  Save this article

Using beam search techniques for sequencing mixed-model assembly lines

Author

Listed:
  • Yow-yuh Leu
  • Philip Huang
  • Roberta Russell

Abstract

This paper introduces a beam search approach to sequencing mixed-model assembly lines and compares that approach to existing sequencing heuristics. The comparison study consists of over 400 test problems that vary in terms of number of product models, quantity of assembly, and degree of component commonality. The results show that beam search techniques are clearly superior to both the goal chasing algorithm (GCA) and Miltenburg and Sinnamon's look ahead heuristic. The second half of this paper extends the beam search approach to allow two scheduling objectives: (1) minimizing parts consumption variation, and (2) minimizing workload variation. Termed filtered beam, this variation uses a filter to eliminate alternatives that exceed a predetermined threshold according to one objective, and then proceeds with the beam search for the second objective. As in the first case, optimization is not guaranteed; however, the filtered beam search provides a frontier of good trade-off solutions from which the decision maker can choose an acceptable sequence. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Yow-yuh Leu & Philip Huang & Roberta Russell, 1997. "Using beam search techniques for sequencing mixed-model assembly lines," Annals of Operations Research, Springer, vol. 70(0), pages 379-397, April.
    • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:379-397:10.1023/a:1018938608304
    DOI: 10.1023/A:1018938608304
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018938608304
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018938608304?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.

    Citations

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


    Cited by:

    1. Xiaobo Zhao & Jianyong Liu & Katsuhisa Ohno & Shigenori Kotani, 2007. "Modeling and analysis of a mixed‐model assembly line with stochastic operation times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 681-691, September.
    2. Thiago Cantos Lopes & Celso Gustavo Stall Sikora & Adalberto Sato Michels & Leandro Magatão, 2020. "Mixed-model assembly lines balancing with given buffers and product sequence: model, formulation comparisons, and case study," Annals of Operations Research, Springer, vol. 286(1), pages 475-500, March.
    3. Sabuncuoglu, Ihsan & Gocgun, Yasin & Erel, Erdal, 2008. "Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling," European Journal of Operational Research, Elsevier, vol. 186(3), pages 915-930, May.
    4. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    5. Xiaobo Zhao & Katsuhisa Ohno & Hon‐Shiang Lau, 2004. "A balancing problem for mixed model assembly lines with a paced moving conveyor," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 446-464, April.

    More about this item

    Statistics

    Access and download statistics

    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:70:y:1997:i:0:p:379-397:10.1023/a:1018938608304. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.