IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v20y2010i1-2-3-4p4-24.html
   My bibliography  Save this article

The sliding frame – extending the concept to various assembly line balancing problems

Author

Listed:
  • Yuval Cohen
  • Ezey Dar-El

Abstract

This paper presents an extension and analysis of a new approach: the sliding frame (SF), based on a fledgling technique. SF could be efficiently applied for solving most line-balancing problems. The main advantage of this approach is its ability to dissect the original problem to small controllable-size sub-problems for which exact techniques can be applied. A key to the sliding is an underlying sequence of activities on which the frame slides. The paper discusses the options for activity sequencing, and some effects of frame size and step size. After illustrating the efficiency of the sliding frame on some classic examples, a more complex model – the assembly line design problem (ALDP) is introduced and solved using a sliding frame. The ALDP minimises both the costs of expansive equipment selection, and the labour cost (reflected by the number of stations).

Suggested Citation

  • Yuval Cohen & Ezey Dar-El, 2010. "The sliding frame – extending the concept to various assembly line balancing problems," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 20(1/2/3/4), pages 4-24.
    • Handle: RePEc:ids:ijmtma:v:20:y:2010:i:1/2/3/4:p:4-24
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=32889
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Zixiang Li & Mukund Nilakantan Janardhanan & S. G. Ponnambalam, 2021. "Cost-oriented robotic assembly line balancing problem with setup times: multi-objective algorithms," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 989-1007, April.

    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:ids:ijmtma:v:20:y:2010:i:1/2/3/4:p:4-24. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    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.