IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v20y1972i3p689-697.html
   My bibliography  Save this article

Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

Author

Listed:
  • D. A. Wismer

    (Systems Control, Inc., Palo Alto, California)

Abstract

This paper presents an algorithm that will minimize the total processing time for a particular case of the n -job, m -machine scheduling problem. In many industrial processes, jobs are processed by a given sequence of machines. Often, once the processing of a job commences, the job must proceed immediately from one machine to the next without encountering any delays en route. The machine sequence need not be the same for an jobs. Because of this processing constraint that prohibits intermediate queues, most normal scheduling techniques are not applicable. This paper obtains a solution to this constrained scheduling problem by modeling it as a traveling-salesman problem; known solution techniques can then be employed. The paper solves a sample problem and discusses computational considerations.

Suggested Citation

  • D. A. Wismer, 1972. "Solution of the Flowshop-Scheduling Problem with No Intermediate Queues," Operations Research, INFORMS, vol. 20(3), pages 689-697, June.
    • Handle: RePEc:inm:oropre:v:20:y:1972:i:3:p:689-697
    DOI: 10.1287/opre.20.3.689
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.3.689
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.20.3.689?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. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    2. Xuemei Qi & Hongtao Wang & Haihong Zhu & Ji Zhang & Fulong Chen & Jie Yang, 2016. "Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4957-4972, August.
    3. Pranzo, Marco, 2004. "Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times," European Journal of Operational Research, Elsevier, vol. 153(3), pages 581-592, March.
    4. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
    5. Zhu, Jie & Li, Xiaoping & Wang, Qian, 2009. "Complete local search with limited memory algorithm for no-wait job shops to minimize makespan," European Journal of Operational Research, Elsevier, vol. 198(2), pages 378-386, October.
    6. Madiha Harrabi & Olfa Belkahla Driss & Khaled Ghedira, 2021. "A hybrid evolutionary approach to job-shop scheduling with generic time lags," Journal of Scheduling, Springer, vol. 24(3), pages 329-346, June.
    7. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    8. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    9. Stafford, Edward F. & Tseng, Fan T., 2002. "Two models for a family of flowshop sequencing problems," European Journal of Operational Research, Elsevier, vol. 142(2), pages 282-293, October.
    10. Chauhan, Satyaveer S. & Gordon, Valery & Proth, Jean-Marie, 2007. "Scheduling in supply chain environment," European Journal of Operational Research, Elsevier, vol. 183(3), pages 961-970, December.
    11. Marcin Mucha & Maxim Sviridenko, 2016. "No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 247-254, February.

    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:inm:oropre:v:20:y:1972:i:3:p:689-697. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.