IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v46y2008i20p5827-5847.html
   My bibliography  Save this article

A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options

Author

Listed:
  • F.-Y. Ding
  • J. He

Abstract

Mixed-model assembly nowadays is a common practice in the automobile industry. In an automobile assembly plant, many car options often need to be considered in sequencing an assembly line, for example, the multiple sequencing objectives that consider a pattern, blocking, spacing, and smoothing of options. A general heuristic procedure is developed in this paper for sequencing automobile assembly lines considering multiple options. The procedure obtains an initial sequence by an enhanced constructive procedure, swaps orders for the most deteriorating category of objectives, and performs re-sequencing attempting to improve the swapped sequence. The heuristic procedure was shown to frequently improve the initial sequences by swapping and re-sequencing when swapping opportunities exist. A further improvement step is also proposed to perform a limited search based on the swapped solution. The limited-search improvement step was shown to be effective in further improving solutions from the heuristic procedure in the computational experimentation. Solutions from the heuristic procedure in conjunction with the limited-search improvement step were compared to those from the simulated annealing procedure for large-size problems and showed relatively positive results.

Suggested Citation

  • F.-Y. Ding & J. He, 2008. "A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options," International Journal of Production Research, Taylor & Francis Journals, vol. 46(20), pages 5827-5847, January.
  • Handle: RePEc:taf:tprsxx:v:46:y:2008:i:20:p:5827-5847
    DOI: 10.1080/00207540701381291
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207540701381291
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207540701381291?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.

    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:taf:tprsxx:v:46:y:2008:i:20:p:5827-5847. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.