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

The permutation flow shop problem with sum‐of‐completion times performance criterion

Author

Listed:
  • Selcuk Karabati
  • Panagiotis Kouvelis

Abstract

In this article we address the non‐preemptive flow shop scheduling problem for minimization of the sum of the completion times. We present a new modeling framework and give a novel game‐theoretic interpretation of the scheduling problem. A lower‐bound generation scheme is developed by solving appropriately defined linear assignment problems. This scheme can also be used as a heuristic approach for the solution of the problem with satisfactory results. Its main use, however, is as a bounding scheme within a branch‐and‐bound procedure. Our branch‐and‐bound procedure improves significantly upon the best available enu‐merative procedures in the current literature. Extensive computational results are used to qualify the above statements. © 1993 John Wiley & Sons, Inc.

Suggested Citation

  • Selcuk Karabati & Panagiotis Kouvelis, 1993. "The permutation flow shop problem with sum‐of‐completion times performance criterion," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(6), pages 843-862, October.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:6:p:843-862
    DOI: 10.1002/1520-6750(199310)40:63.0.CO;2-A
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199310)40:63.0.CO;2-A
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199310)40:63.0.CO;2-A?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. B. J. Lageweg & J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "A General Bounding Scheme for the Permutation Flow-Shop Problem," Operations Research, INFORMS, vol. 26(1), pages 53-67, February.
    2. Ahmadi, Reza H. & Bagchi, Uttarayan, 1990. "Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop," European Journal of Operational Research, Elsevier, vol. 44(3), pages 331-336, February.
    3. Wlodzimierz Szwarc, 1978. "Permutation flow‐shop theory revisited," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(3), pages 557-570, September.
    4. Edward Ignall & Linus Schrage, 1965. "Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems," Operations Research, INFORMS, vol. 13(3), pages 400-412, June.
    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 & 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.

    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. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2002. "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," International Journal of Production Economics, Elsevier, vol. 79(3), pages 185-196, October.
    2. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    3. B-J Joo & Y-D Kim, 2009. "A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 572-582, April.
    4. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    5. Detienne, Boris & Sadykov, Ruslan & Tanaka, Shunji, 2016. "The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation," European Journal of Operational Research, Elsevier, vol. 252(3), pages 750-760.
    6. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.
    7. Olivier Ploton & Vincent T’kindt, 2023. "Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion," Journal of Scheduling, Springer, vol. 26(2), pages 137-145, April.
    8. Kim, Yeong-Dae, 1995. "Minimizing total tardiness in permutation flowshops," European Journal of Operational Research, Elsevier, vol. 85(3), pages 541-555, September.
    9. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    10. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    11. J. A. Hoogeveen & T. Kawaguchi, 1999. "Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases," Mathematics of Operations Research, INFORMS, vol. 24(4), pages 887-910, November.
    12. Lei Shang & Christophe Lenté & Mathieu Liedloff & Vincent T’Kindt, 2018. "Exact exponential algorithms for 3-machine flowshop scheduling problems," Journal of Scheduling, Springer, vol. 21(2), pages 227-233, April.
    13. Gmys, Jan & Mezmaz, Mohand & Melab, Nouredine & Tuyttens, Daniel, 2020. "A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 284(3), pages 814-833.
    14. Della Croce, F. & Narayan, V. & Tadei, R., 1996. "The two-machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 227-237, April.
    15. Chengen Wang & Chengbin Chu & Proth, Jean-Marie, 1997. "Heuristic approaches for n/m/F/ [summation operator]Ci scheduling problems," European Journal of Operational Research, Elsevier, vol. 96(3), pages 636-644, February.
    16. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    17. Liaw, Ching-Fang, 2005. "Scheduling preemptive open shops to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 162(1), pages 173-183, April.
    18. Baptiste, Pierre, 2006. "Stochastic algorithms: Using the worst to reach the best," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 41-51, February.
    19. Allahverdi, Ali & Al-Anzi, Fawaz S., 2006. "A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times," European Journal of Operational Research, Elsevier, vol. 169(3), pages 767-780, March.
    20. Ishibuchi, Hisao & Misaki, Shinta & Tanaka, Hideo, 1995. "Modified simulated annealing algorithms for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 81(2), pages 388-398, March.

    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:40:y:1993:i:6:p:843-862. 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.