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

Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints

Author

Listed:
  • R. Kolisch
  • K. Hess

Abstract

We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high-volume, discrete maketo-order products. Based on a list scheduling procedure proposed by Kolisch in 1999 we introduce three efficient heuristic solution methods. Namely, a biased random sampling method and two tabu search-based large-step optimization methods. The two latter methods differ in the employed neighbourhood. The first one uses a simple API-neighbourhood while the second one uses a more elaborated so-called 'critical neighbourhood' which makes use of problem insight. All three procedures are assessed on a systematically generated set of test instances. The results indicate that especially the large-step optimization method with the critical neighbourhood gives very good results which are significant better than simple single-pass list scheduling procedures.

Suggested Citation

  • R. Kolisch & K. Hess, 2000. "Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 38(1), pages 207-228, January.
    • Handle: RePEc:taf:tprsxx:v:38:y:2000:i:1:p:207-228
    DOI: 10.1080/002075400189653
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/002075400189653
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/002075400189653?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:38:y:2000:i:1:p:207-228. 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.