IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v57y2006i1d10.1057_palgrave.jors.2601987.html
   My bibliography  Save this article

Scheduling multi-stage parallel-processor services to minimize average response time

Author

Listed:
  • A Allahverdi

    (Kuwait University)

  • F S Al-Anzi

    (Kuwait University)

Abstract

The problem of scheduling on a multi-stage parallel-processor architecture in computer centres is addressed with the objective of minimizing average completion time of a set of requests. The problem is modelled as a flexible flowshop problem for which few heuristics exist in the flowshop scheduling literature. A new three-phase heuristic is proposed in this paper. An extensive computational experiment has been conducted to compare the performance of the existing heuristics and the proposed heuristic. The results indicate that the proposed heuristic significantly outperforms the existing ones. More specifically, the overall average error of the best existing heuristic is about five times that of the proposed heuristic while the overall average CPU time of the proposed heuristic is about half of the best existing one. More importantly, as the number of requests increases, the CPU time of the proposed heuristic decreases considerably (compared to the best existing heuristic) while the ratio of the error (of the best existing to the proposed heuristic) of about five times remains almost the same.

Suggested Citation

  • A Allahverdi & F S Al-Anzi, 2006. "Scheduling multi-stage parallel-processor services to minimize average response time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 101-110, January.
    • Handle: RePEc:pal:jorsoc:v:57:y:2006:i:1:d:10.1057_palgrave.jors.2601987
    DOI: 10.1057/palgrave.jors.2601987
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601987
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601987?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.

    References listed on IDEAS

    as
    1. Grabowski, Jozef & Pempera, Jaroslaw, 2000. "Sequencing of jobs in some production system," European Journal of Operational Research, Elsevier, vol. 125(3), pages 535-550, September.
    2. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
    3. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.
    4. Rahendran, Chandrasekharan & Chaudhuri, Dipak, 1992. "A multi-stage parallel-processor flowshop problem with minimum flowtime," European Journal of Operational Research, Elsevier, vol. 57(1), pages 111-122, February.
    5. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    6. Teofilo Gonzalez & Sartaj Sahni, 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation," Operations Research, INFORMS, vol. 26(1), pages 36-52, February.
    7. Gendreau, Michel & Laporte, Gilbert & Guimaraes, Eduardo Morais, 2001. "A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 133(1), pages 183-189, August.
    8. M. Y. Wang & S. P. Sethi & S. L. van de Velde, 1997. "Minimizing Makespan in a Class of Reentrant Shops," Operations Research, INFORMS, vol. 45(5), pages 702-712, October.
    9. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    10. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    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. 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.

    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. 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.
    2. 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.
    3. 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.
    4. Fan Yang & Roel Leus, 2021. "Scheduling hybrid flow shops with time windows," Journal of Heuristics, Springer, vol. 27(1), pages 133-158, April.
    5. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    6. Jianming Dong & Yong Chen & An Zhang & Qifan Yang, 2013. "A new three-machine shop scheduling: complexity and approximation algorithm," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 799-810, November.
    7. L Tang & H Xuan, 2006. "Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 316-324, March.
    8. Carlos Paternina-Arboleda & Jairo Montoya-Torres & Milton Acero-Dominguez & Maria Herrera-Hernandez, 2008. "Scheduling jobs on a k-stage flexible flow-shop," Annals of Operations Research, Springer, vol. 164(1), pages 29-40, November.
    9. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    10. Chern, Ching-Chin & Chien, Pei-Szu & Chen, Shu-Yi, 2008. "A heuristic algorithm for the hospital health examination scheduling problem," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1137-1157, May.
    11. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
    12. Bertel, S. & Billaut, J. -C., 2004. "A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation," European Journal of Operational Research, Elsevier, vol. 159(3), pages 651-662, December.
    13. 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.
    14. Sung, C.S. & Kim, Hyun Ah, 2008. "A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times," International Journal of Production Economics, Elsevier, vol. 113(2), pages 1038-1048, June.
    15. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    16. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    17. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    18. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
    19. Liu, Jiyin & Reeves, Colin R, 2001. "Constructive and composite heuristic solutions to the P//[summation operator]Ci scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(2), pages 439-452, July.
    20. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.

    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:pal:jorsoc:v:57:y:2006:i:1:d:10.1057_palgrave.jors.2601987. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.