Skip to main content
SpringerLink
Log in

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

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 10
Figure 7
Figure 8
Figure 9

Similar content being viewed by others

References

  • Gonzalez T and Sahni S (1978). Flow shop and job shop schedules. Opns Res 26: 36–52.

    Article  Google Scholar 

  • Linn R and Zhang W (1999). Hybrid flowshop scheduling: a survey. Comput Ind Eng 37: 57–61.

    Article  Google Scholar 

  • Rajendran C and Chaudhuri D (1992). A multi-stage parallel-processor flowshop problem with minimum flowtime. Eur J Opl Res 57: 111–122.

    Article  Google Scholar 

  • Sridhar J and Rajendran C (1993). Scheduling in a cellular manufacturing system: a simulated annealing approach. Int J Prod Res 31: 2927–2945.

    Article  Google Scholar 

  • Brah SA and Loo LL (1999). Heuristics for scheduling in a flow shop with multiple processors. Eur J Opl Res 113: 113–122.

    Article  Google Scholar 

  • Azizoglu M, Cakmak E and Kondakci S (2001). A flexible flowshop problem with total flow time minimization. Eur J Opl Res 132: 528–538.

    Article  Google Scholar 

  • Al-Anzi F and Allahverdi A (2002). Flexible multi-stage parallel-server scheduling for internet service architecture. Int J Parallel Distrib Systems Networks 5: 134–142.

    Google Scholar 

  • Cheng TCE, Lin BMT and Toker A (2000). Makespan minimization in the two-machine flowshop batch scheduling problem. Navel Res Log 47: 128–144.

    Article  Google Scholar 

  • Choi AH and Lee JSL (2000). A sequence algorithm for minimizing makespan in multi-part and multi-machine flowshop case. Integrated Manuf Systems 11: 62–73.

    Article  Google Scholar 

  • Moursli O and Pochet Y (2000). A branch-and-bound algorithm for the hybrid flowshop. Int J Prod Econ 64: 113–125.

    Article  Google Scholar 

  • Grabowski J and Pempera J (2000). Sequencing of jobs in some production system. Eur J Opl Res 125: 535–550.

    Article  Google Scholar 

  • Gendreau M, Laporte G and Guimaraes EM (2001). A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Eur J Opl Res 133: 183–189.

    Article  Google Scholar 

  • Negenman EG (2001). Local search algorithms for the multiprocessor flow shop scheduling problem. Eur J Opl Res 128: 147–158.

    Article  Google Scholar 

  • Rajendran C and Chaudhuri D (1991). An efficient heuristic approach to the scheduling of jobs in a flowshop. Eur J Opl Res 61: 318–325.

    Article  Google Scholar 

  • Ho JC (1995). Flowshop sequencing with mean flowtime objective. Eur J Opl Res 81: 571–578.

    Article  Google Scholar 

  • Knuth DE (1973). The Art of Computer Programming: Sorting and Searching. Addison-Wesley: MA, USA.

    Google Scholar 

  • Nawaz M, Enscore E and Ham I (1983). A heuristic for the m-machine, n-job flowshop sequencing problem. OMEGA Int J Mngt Sci 11: 91–95.

    Article  Google Scholar 

  • Wang MY, Sethi SP and Van De Velde SL (1997). Minimizing makespan in a class of reentrant shops. Opns Res 45: 702–712.

    Article  Google Scholar 

  • Pan CH and Chen JS (1997). Scheduling alternative operations in two-machine flow-shops. J Opl Res Soc 48: 533–540.

    Article  Google Scholar 

  • Al-Anzi F and Allahverdi A (2001). The relation between three-tired client-server internet database and two-machine flowshop. Int J Parallel Distrib Systems Networks 4: 94–101.

    Google Scholar 

  • Allahverdi A and Al-Anzi F (2002). Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. Comput Opns Res 29: 971–994.

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by Kuwait University Research Administration project number EO 05/02.

Author information

Authors and Affiliations

  1. Kuwait University, Safat, Kuwait

    A Allahverdi & F S Al-Anzi

Authors
  1. A Allahverdi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F S Al-Anzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A Allahverdi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Allahverdi, A., Al-Anzi, F. Scheduling multi-stage parallel-processor services to minimize average response time. J Oper Res Soc 57, 101–110 (2006). https://doi.org/10.1057/palgrave.jors.2601987

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601987

Keywords

Search

Navigation