Skip to main content
Log in

A study of optimal allocation of computing resources in cloud manufacturing systems

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

As a new advanced service-oriented networked manufacturing model, cloud manufacturing (CMfg) has been proposed recently. The optimal allocation of computing resources (OACR) is a core part for implementing CMfg. High heterogeneity, high dynamism, and virtualization make the OACR problem more complex than the traditional scheduling problems in grid system or cloud computing system. In this paper, a new comprehensive model for OACR is proposed in the CMfg system. In this model, all main computation, communication, and reliability constraints in the special circumstances are considered. To solve the OACR problem, a new improved niche immune algorithm was presented. Associated with the niche strategy, new heuristics are designed flexibly based on the characteristics of the problem and pheromone is added for adaptive searching. Experiments demonstrate the effectiveness of the designed heuristic information and show NIA’s high performances for addressing the OACR problem compared with other intelligent algorithms.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Yusuf YY, Sarhadi M, Gunasekaran A (1999) Agile manufacturing: the drivers, concepts and attributed. Int J Prod Econ 62(1–2):33–43

    Article  Google Scholar 

  2. Flammia G (2001) Application service providers: challenges and opportunities. IEEE Intel Syst Appl 16(1):22–23

    Article  Google Scholar 

  3. Tao F, Hu YF, Zhou ZD (2008) Study on manufacturing grid & its resource service optimal-selection system. Int J Adv Manuf Technol 37(9–10):1022–1041

    Article  Google Scholar 

  4. Li BH, Zhang L, Wang SL, Tao F, Cao JW, Jiang XD, Song X, Chai XD (2010) Cloud manufacturing: a new service-oriented networked manufacturing model. Comput Integr Manuf Syst 16(1):1–16

    Google Scholar 

  5. Tao F, Zhang L, Venkatesh VC, Luo YL, Cheng Y (2011) Cloud manufacturing: a computing and service-oriented manufacturing model. Proc Inst Mech Eng B, J Eng Manuf 225(10):1969–1976

    Article  Google Scholar 

  6. Zhang L, Luo YL, Tao F, Ren L, Guo H (2010) Key technologies for the construction of manufacturing cloud. Comput Integr Manuf Syst 16(11):2510–2520

    Google Scholar 

  7. He K, Zhao Y (2005) Research of grid resource management and scheduling. J WuHan Univ Technol (Inf Manag Eng) 27(4):1–5

    Google Scholar 

  8. Ullman JD (1975) NP-complete scheduling problems. J Comput Syst Sci 10(3):384–393

    Article  MathSciNet  MATH  Google Scholar 

  9. Zhang L, Luo YL, Fan WH, Tao F, Ren L (2011) Analysis of cloud manufacturing and related advanced manufacturing models. Comput Integr Manuf Syst 17(3):458–468

    Google Scholar 

  10. Li BH, Zhang L, Chai XD, Tao F, Luo YL, Wang YZ, Yin C, Huang G, Zhao XP (2011) Further discussion on cloud manufacturing. Comput Integr Manuf Syst 27(3):449–457

    Google Scholar 

  11. Tao F, Zhang L, Hu YF (2011) Resource Services Management in Manufacturing Grid System. Wiley-Scrivener Publishing, Dec. 2011.

    Book  Google Scholar 

  12. Tao F, Zhang L, Luo YL, Ren L (2011) Typical characteristic of cloud manufacturing and several key issues of cloud service composition. Comput Integr Manuf Syst 17(3):477–486

    Google Scholar 

  13. Park J, Kang M, Lee K (1996) An intelligent operations scheduling system in a job shop. Int J Adv Manuf Technol 11(2):111–119

    Article  Google Scholar 

  14. Jiao LM, Khoo LP, Chen CH (2004) An intelligent concurrent design task planner for manufacturing system. Int J Adv Manuf Technol 23(9–10):672–681

    Article  Google Scholar 

  15. Liang JJ, Pan QK, Chen TJ, Wang L (2011) Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer. Int J Adv Manuf Technol 55(5–8):755–762

    Article  Google Scholar 

  16. Zou ZM, Li CX (2006) Integrated and events-oriented job shop scheduling. Int J Adv Manuf Technol 29(5–6):551–556

    Google Scholar 

  17. Hu PC (2005) Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 25(9–10):1046–1052

    Article  Google Scholar 

  18. Kwok YK, Ahmad I (1999) Benchmarking and comparison of the task graph scheduling algorithms. J Parallel Distrib Comput 59(3):381–422

    Article  MATH  Google Scholar 

  19. Polychronopoulos CD (1991) The hierarchical task graph and its use in auto-scheduling. Proceedings of the 5th International Conference on Supercomputing (ICS’ 91).

  20. Bokhari SH (1979) Dual processor scheduling with dynamic reassignment. IEEE Trans Softw Eng 5(4):341–349

    Article  MathSciNet  Google Scholar 

  21. Stone HS (1977) Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans Softw Eng 3(1):85–93

    Article  MATH  Google Scholar 

  22. M Madhukar, M Leuze, L Dowdy. Petri net model of a dynamically partitioned multiprocessors system. Proceedings of the 6th International Workshop on Petri Nets and Performance Models (PNPM’ 95), 1995.

  23. Buyya R, Abramson D, Venugopal S (2005) The grid economy. Proc IEEE 93(3):698–714

    Article  Google Scholar 

  24. Cardoso J, Sheth A, Miller J, Arnold J, Kochut K (2004) Quality of service for workflows and web service processes. Web Semant Sci, Serv Agents World Wide Web 1(3):281–308

    Article  Google Scholar 

  25. Saravanan M, Haq AN (2008) Evaluation of scatter-search approach for scheduling optimization of flexible manufacturing systems. Int J Adv Manuf Technol 38(9–10):978–986

    Article  Google Scholar 

  26. Chaudhry IA, Drake PR (2009) Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms. Int J Adv Manuf Technol 42(5–6):581–594

    Article  Google Scholar 

  27. Wang LY, Wang JB, Gao WJ, Huang X, Feng EM (2010) Two single-machine scheduling problems with the effects of deterioration and learning. Int J Adv Manuf Technol 46(5–8):715–720

    Article  Google Scholar 

  28. Yang T, Gerasoulis A (1993) DSC: scheduling parallel tasks on an unbounded number of processors. IEEE Trans Parallel Distrib Syst 5(9):951–967

    Article  Google Scholar 

  29. Gerasoulis A, Yang T (1993) On the granularity and clustering of directed acyclic task graphs. IEEE Trans Parallel Distrib Syst 4(6):686–701

    Article  Google Scholar 

  30. Gerasoulis A, Yang T (1994) Performance bounds for parallelizing Gaussian-Elimination and Gauss-Jordan on message-passing machines. Appl Numer Math J 16:283–297

    Article  MathSciNet  MATH  Google Scholar 

  31. Jones WM, Pang LW, Ligon WB, Stanzione D (2005) Characterization of bandwidth-aware meta-schedulers for co-allocating jobs across multiple clusters. J Supercomput 34(2):135–163

    Article  Google Scholar 

  32. Hamscher V, Schwiegelshohn U, Streit A, Yahyapour R (2004) Evaluation of job-scheduling strategies for grid computing. Grid Computing at the 7th International Conference on High Performance Computing, 191–202

  33. Ememann C, Hamscher V, Yahyapou R (2002) On effects of machine configurations on parallel job scheduling in computational grids. Proceedings of the International Conference on Architecture of Computing Systems (ARCS 2002), 169–179

  34. Davidovi T, Hansen P, Mladenovi N (2005) Permutation based genetic, tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays. Asia Pac J Oper Res 22(3):297–326

    Article  MathSciNet  Google Scholar 

  35. Sinnen O, Sousa LA (2005) Communication contention in task scheduling. IEEE Trans Parallel Distrib Syst 16(6):503–515

    Article  Google Scholar 

  36. Sinnen O, Sousa LA, Sandnes FE (2006) Toward a realistic task scheduling model. IEEE Trans Parallel Distrib Syst 17(3):263–275

    Article  Google Scholar 

  37. Benoit A, Marchal L, Pineau JF (2010) Scheduling concurrent bag-of-tasks applications on heterogeneous platforms. IEEE Trans Comput 59(2):202–217

    Article  MathSciNet  Google Scholar 

  38. Adam TL, Chandy KM, Dickson JR (1974) A comparison of list schedules for parallel processing systems. Commun ACM 17(12):685–690

    Article  MATH  Google Scholar 

  39. Sinnen O, Sousa LA (2004) List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Comput 30(1):81–101

    Article  Google Scholar 

  40. Wu MY, Gajski DD (1990) Hypertool: a programming aid for message-passing systems. IEEE Trans Parallel Distrib Syst 1(3):330–343

    Article  Google Scholar 

  41. Sarkar V (1989) Partitioning and scheduling of parallel programs for multiprocessors (Research Monographs in Parallel Computing). MIT Press, Cambridge

    Google Scholar 

  42. Chen S, Eshaghian MM, Wu Y (1995) Mapping arbitrary non-uniform task graphs onto arbitrary non-uniform system graphs. Proceedings of the International Conference on Parallel Processing

  43. Yang L, Gohad T, Ghosh P, Sinha D, Sen A, Richa A (2005) Resource mapping and scheduling for heterogeneous network processor systems. Proceedings of the 2005 ACM Symposium on Architecture for Networking and Communications Systems (ANCS’ 05), 19–28

  44. Weng N, Wolf T (2005) Profiling and mapping of parallel workloads on network processors. Proceedings of the 20th Annual ACM Symposium on Applied Computing (SAC), 890–896.

  45. Huang JG, Chen JE, Chen SQ (2004) Parallel-job scheduling on cluster computing system. Chin J Comput 27(6):765–771

    Google Scholar 

  46. Huang JG (2008) Approximation algorithm on multi-processor job scheduling. Comput Eng Appl 44(32):26–28

    Google Scholar 

  47. Yin GF, Luo Y, Long HN, Cheng EJ (2004) Genetic algorithms for subtask scheduling in concurrent design. J Comput-Aided Des Comput Graph 16(8):1122–1126

    Google Scholar 

  48. Correa RC, Ferreira A, Rebreyend P (1999) Scheduling multiprocessor tasks with genetic algorithms. IEEE Trans Parallel Distrib Syst 10(8):825–837

    Article  Google Scholar 

  49. Tsai JT, Liu TK, Ho WH, Chou JH (2008) An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover. Int J Adv Manuf Technol 38(9–10):987–994

    Article  Google Scholar 

  50. Chen YW, Lu YZ, Yang GK (2008) Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling. Int J Adv Manuf Technol 36(9–10):959–968

    Article  Google Scholar 

  51. Wang G, Gong WR, DeRenzi B, Kastner R (2007) Ant colony optimizations for resource and timing constrained operation scheduling. IEEE Trans Comput-Aided Des Integr Circuit Syst 26(6):1010–1029

    Article  Google Scholar 

  52. Chen WN, Zhang J (2009) An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern 39(1):29–43

    Article  Google Scholar 

  53. Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55(9–12):1159–1169

    Article  Google Scholar 

  54. Xu XD, Li CX (2007) Research on immune genetic algorithm for solving the job-shop scheduling problem. Int J Adv Manuf Technol 34(7–8):783–789

    Article  Google Scholar 

  55. Agarwal R, Tiwari MK, Mukherjee SK (2007) Artificial immune system based approach for solving resource constraint project scheduling problem. Int J Adv Manuf Technol 34(5–6):584–593

    Article  Google Scholar 

  56. Tao F, Zhao D, Hu YF, Zhou ZD (2008) Resource service composition and its optimal-selection based on particle swarm optimization in manufacturing grid system. IEEE Transactions on Industrial Informatics, 4(4):315–327.

    Article  Google Scholar 

  57. Maheswaran R, Ponnambalam SG, Aravindan C (2005) A meta-heuristic approach to single machine scheduling problems. Int J Adv Manuf Technol 25(7–8):772–776

    Article  Google Scholar 

  58. Jerald J, Asokan P, Saravanan R, Delphin A, Rani C (2006) Simultaneous scheduling of parts and automated guided vehicles in an FMS environment using adaptive genetic algorithm. Int J Adv Manuf Technol 29(5–6):584–589

    Google Scholar 

  59. Shukla SK, Son YJ, Tiwari MK (2008) Fuzzy-based adaptive sample-sort simulated annealing for resource-constrained project scheduling. Int J Adv Manuf Technol 36(9–10):982–995

    Article  Google Scholar 

  60. Zhang JX, Gu ZM, Zheng C (2010) Survey of research progress on cloud computing. Appl Res Comput 27(2):429–433

    Google Scholar 

  61. Hong B, Prasanna VK (2004) Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS’ 04)

  62. Bhat PB, Raghavendra CS, Prasanna VK (2003) Efficient collective communication in distributed heterogeneous systems. J Parallel Distrib Comput 63(3):251–263

    Article  MATH  Google Scholar 

  63. Gawiejnowics S (2008) Time-dependent scheduling. Springer, Berlin

    Google Scholar 

  64. Wang L, Pan J, Jiao LC (2000) The immune programming. Chin J Comput 23(8):806–812

    Google Scholar 

  65. Wang L, Pan J, Jiao LC (2000) The immune algorithm. Acta Electronica Sinica 28(74):7–77

    Google Scholar 

  66. Tao F, Zhang L, Nee A Y C (2011) A review of the application of grid technology in manufacturing. International Journal of Production Research, 49(13): 4119–4155

    Article  Google Scholar 

  67. Tao F, Zhao D, Zhang L (2010) Resource service optimal-selection based on intuitionistic fuzzy set and non-functionality QoS in manufacturing grid system. Knowledge and Information Systems, 25(1):185–208

    Article  Google Scholar 

  68. Tao F, Zhao D, Hu YF, Zhou ZD (2010) Correlation-aware resource service composition and optimal-selection in manufacturing grid, European Journal of Operational Research, 201(1):129–143

    Article  MATH  Google Scholar 

  69. Tao F, Hu YF, Zhao D, Zhou ZD (2010) Study of failure detection and recovery in manufacturing grid resource service scheduling. International Journal of Production Research,48(1):69–94

    Google Scholar 

  70. Tao F, Hu YF, Zhou ZD (2009) Application and modeling of resource service trust-QoS evaluation in manufacturing grid system. International Journal of Production Research, 47(6):1521–1550

    Article  Google Scholar 

  71. Tao F, Hu YF, Zhao D, Zhou ZD (2009) Study on resource service match and search in manufacturing grid system.International Journal of Advanced Manufacturing Technology, 43(3-4):379–399

    Google Scholar 

  72. Tao F, Hu YF, Zhao D, Zhou ZD (2009) An Approach to Manufacturing Grid Resource Service Scheduling based on Trust-QoS. International Journal of Computer Integrated Manufacturing, 22(2):100–111

    Article  Google Scholar 

  73. Tao F, Hu YF, Zhao D, Zhou ZD (2009) Study on Manufacturing Grid Resource Service QoS Modeling and Evaluation. International Journal of Advanced Manufacturing Technology, 41(9–10):1034–1042

    Article  Google Scholar 

  74. Tao F, Hu YF, Zhou ZD (2008) Study on Manufacturing Grid & Its Resource Service Optimal-Selection System. International Journal of Advanced Manufacturing Technology, 37(9–10):1022–1041

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fei Tao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Laili, Y., Tao, F., Zhang, L. et al. A study of optimal allocation of computing resources in cloud manufacturing systems. Int J Adv Manuf Technol 63, 671–690 (2012). https://doi.org/10.1007/s00170-012-3939-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-3939-0

Keywords

Navigation