IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i5p695-705.html
   My bibliography  Save this article

Heuristic algorithms for continuous flow‐shop problem

Author

Listed:
  • Chandrasekharan Rajendran
  • Dipak Chaudhuri

Abstract

In this article we present two heuristic algorithms for scheduling in the constrained or continuous flow shop to minimize total flow time of jobs. Two heuristic preference relations are used as the basis for job insertion to build up a schedule by the heuristics. When evaluated over a large number of problems of various sizes, the heuristics are found to be very effective in yielding near‐optimal solutions.

Suggested Citation

  • Chandrasekharan Rajendran & Dipak Chaudhuri, 1990. "Heuristic algorithms for continuous flow‐shop problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 695-705, October.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:5:p:695-705
    DOI: 10.1002/1520-6750(199010)37:53.0.CO;2-L
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199010)37:53.0.CO;2-L
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199010)37:53.0.CO;2-L?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
    ---><---

    References listed on IDEAS

    as
    1. Robert L. Karg & Gerald L. Thompson, 1964. "A Heuristic Approach to Solving Travelling Salesman Problems," Management Science, INFORMS, vol. 10(2), pages 225-248, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Allahverdi, Ali, 1999. "Stochastically minimizing total flowtime in flowshops with no waiting space," European Journal of Operational Research, Elsevier, vol. 113(1), pages 101-112, February.
    2. 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.
    3. Allahverdi, Ali & Aldowaisan, Tariq, 2002. "New heuristics to minimize total completion time in m-machine flowshops," International Journal of Production Economics, Elsevier, vol. 77(1), pages 71-83, May.
    4. Krusin-Elbaum, L. & Malozemoff, A.P. & Cronemeyer, D.C. & Holtzberg, F. & Chandrashekhar, G.V. & Clem, J.R. & Hao, Z., 1990. "Residual irreversibility in high-Tc superconductors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 168(1), pages 367-377.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ozgur, C. O. & Brown, J. R., 1995. "A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem," Omega, Elsevier, vol. 23(2), pages 205-219, April.
    2. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    3. Ferretti, Ivan & Zanoni, Simone & Zavanella, Lucio, 2006. "Production-inventory scheduling using Ant System metaheuristic," International Journal of Production Economics, Elsevier, vol. 104(2), pages 317-326, December.
    4. Dillmann, Roland & Becker, Burkhard & Beckefeld, Volker, 1996. "Practical aspects of route planning for magazine and newspaper wholesalers," European Journal of Operational Research, Elsevier, vol. 90(1), pages 1-12, April.
    5. C P Keller & M F Goodchild, 1988. "The Multiobjective Vending Problem: A Generalization of the Travelling Salesman Problem," Environment and Planning B, , vol. 15(4), pages 447-460, December.
    6. Biskup, Dirk & Herrmann, Jan & Gupta, Jatinder N.D., 2008. "Scheduling identical parallel machines to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 115(1), pages 134-142, September.
    7. Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
    8. Rego, Cesar, 2001. "Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 1," European Journal of Operational Research, Elsevier, vol. 129(2), pages 456-459, March.
    9. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    10. Roy E. Marsten, 1972. "An Algorithm for Finding Almost All Of The Medians of a Network," Discussion Papers 23, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    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:navres:v:37:y:1990:i:5:p:695-705. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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)1520-6750 .

    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.