Skip to main content

Advertisement

SpringerLink
Log in

A game-theory approach for job scheduling in networked manufacturing

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

Abstract

This paper presents a new kind of scheduling solution for jobs in networked manufacturing environments. The main contributions of this study can be focused on three points: The first is to distinguish the concepts and requirements of job scheduling in the networked manufacturing environment form those in the traditional manufacturing environment. The second is to construct a game-theory mathematical model to deal with this new job scheduling problem. In this presented mathematical model, this new job scheduling problem is formulated as an N-person non-cooperative game with complete information. The players correspond to the jobs submitted, respectively, by related customers and the payoff of each job is defined as its makespan. Each player has a set of strategies which correspond to the feasible geographical distributive machines. Therefore, obtaining the optimal scheduling results is determined by the Nash equilibrium (NE) point of this game. In order to find the NE point, the last point is to design and develop a genetic algorithm (GA)-based solution algorithm to effectively solve this mathematical model. Finally, a numerical example is presented to demonstrate the feasibility of the approach.

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

Similar content being viewed by others

References

  1. Jiang PY, Zhou GH, Zhao G, Zhang YF, Sun HB (2007) e2-MES: an e-service-driven networked manufacturing platform for extended enterprises. Int J Comput Integr Manuf 20(2–3):127–142

    Article  Google Scholar 

  2. Zhou GH, Jiang PY, Zhang DH (2005) Generating a task-driven extended enterprise for e-manufacturing. Int J Internet Enterprise Manage 3(3):264–279

    Article  Google Scholar 

  3. Sousa P, Ramos C (1999) A distributed architecture and negotiation protocol for scheduling in manufacturing systems. Comput Ind 38:103–133

    Article  Google Scholar 

  4. Persi P, Ukovich W, Pesenti R, Nicolich M (1999) A hierarchic approach to production planning and scheduling of a flexible manufacturing system. Robot Integr Manuf Syst 15:373–385

    Article  Google Scholar 

  5. Gou L, Luh PB, Kyoya Y (1998) Holonic manufacturing scheduling: architecture, cooperation, mechanism and implementation. Comput Ind 37:213–231

    Article  Google Scholar 

  6. Yang HS, Wang NS, Zhang JG, Cui XY (1998) Modelling, scheduling and simulation of flexible manufacturing systems using extended stochastic high-level evaluation Petri nets. Robot Auton Syst 14:121–140

    Google Scholar 

  7. Song JS, Lee TE (1998) Petri net modeling and scheduling for cyclic job shops with blocking. Comput Ind Eng 34(2):281–295

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  9. Sakawa M, Mori T (1999) An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy due date. Comput Ind Eng 36:325–341

    Article  Google Scholar 

  10. Mattfeld DC, Bierwirth C (2004) An efficient genetic algorithm for job scheduling with tardiness objectives. Eur J Oper Res 155:616–630

    Article  MATH  MathSciNet  Google Scholar 

  11. Senthilkumar P, Shahabudeen P (2006) GA-based heuristic for the open job shop scheduling problem. Int J Adv Manuf Technol 30(3–4):297–301

    Article  Google Scholar 

  12. Engin O, Döyen A (2004) A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener Comput Syst 20:1083–1095

    Article  Google Scholar 

  13. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total fowtime of jobs. Eur J Oper Res 155:426–438

    Article  MATH  MathSciNet  Google Scholar 

  14. Ying KC, Liao CJ (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31:791–801

    Article  MATH  Google Scholar 

  15. Chandrasekaran M, Asokan P, Kumanan S, Balamurugan T, Nickolas S (2006) Solving job shop scheduling problems using artificial immune system. Int J Adv Manuf Technol 31(5–6):580–593

    Article  Google Scholar 

  16. Seredyński F (1997) Competitive co evolutionary multi-agent systems: the application to mapping and scheduling problems. J Parallel Distrib Comput 47:39–57

    Article  Google Scholar 

  17. Seredyński F (1998) Distributed scheduling using simple learning machines. Eur J Oper Res 107:401–413

    Article  MATH  Google Scholar 

  18. Seredyński F, Koronacki J, Janikow CZ (2001) Distributed multiprocessor scheduling with decomposed optimization criterion. Future Gener Comput Syst 17:387–396

    Article  MATH  Google Scholar 

  19. Kim JH, Park JB, Park JK, Kim BH (2003) A new game-theoretic framework for maintenance strategy analysis. IEEE Trans Power Syst 18(2):698–706

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiaotong University, Xi’an, 710049, China

    Guanghui Zhou & Pingyu Jiang

  2. School of Mechanical Engineering, Xi’an Jiaotong University, Xi’an, 710049, China

    Guanghui Zhou & Pingyu Jiang

  3. Department of Industrial and Manufacturing Systems Engineering, The University of Hong Kong, Hong Kong, China

    George Q. Huang

Authors
  1. Guanghui Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pingyu Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Q. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guanghui Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, G., Jiang, P. & Huang, G.Q. A game-theory approach for job scheduling in networked manufacturing. Int J Adv Manuf Technol 41, 972–985 (2009). https://doi.org/10.1007/s00170-008-1539-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1539-9

Keywords

Search

Navigation