IDEAS home Printed from https://ideas.repec.org/a/wly/apsmda/v9y1993i2p127-138.html
   My bibliography  Save this article

A scheduling algorithm for flexible flow lines with limited intermediate buffers

Author

Listed:
  • Tadeusz J. Sawik

Abstract

A new heuristic algorithm is proposed for scheduling a flexible flow line with limited in‐process buffers. The line is made up of a certain number of processing stages. Each stage has one or more identical parallel machines with limited buffers. Each part is processed by at most one machine in each stage. The problem objective is to minimize the makespan of the schedule for a set of part types selected for processing. The computational results for a set of test problems used in the literature are reported. In addition, the efficiency of the algorithm is tested on several groups of random problems.

Suggested Citation

  • Tadeusz J. Sawik, 1993. "A scheduling algorithm for flexible flow lines with limited intermediate buffers," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 9(2), pages 127-138, June.
    • Handle: RePEc:wly:apsmda:v:9:y:1993:i:2:p:127-138
    DOI: 10.1002/asm.3150090206
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asm.3150090206
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asm.3150090206?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
    ---><---

    Citations

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


    Cited by:

    1. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    2. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    3. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    4. Florian Jaehn & Sergey Kovalev & Mikhail Y. Kovalyov & Erwin Pesch, 2014. "Multiproduct batching and scheduling with buffered rework: The case of a car paint shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(6), pages 458-471, September.
    5. Wardono, Bagas & Fathi, Yahya, 2004. "A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities," European Journal of Operational Research, Elsevier, vol. 155(2), pages 380-401, June.
    6. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    7. Logendran, Rasaratnam & Carson, Sara & Hanson, Erik, 2005. "Group scheduling in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 96(2), pages 143-155, May.

    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:wly:apsmda:v:9:y:1993:i:2:p:127-138. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-0747 .

    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.