File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A game-theory approach for job scheduling in networked manufacturing

TitleA game-theory approach for job scheduling in networked manufacturing
Authors
KeywordsGenetic algorithm
Job scheduling
Nash equilibrium
Networked manufacturing
Non-cooperative game
Issue Date2009
PublisherSpringer U K. The Journal's web site is located at http://www.springer.com/engineering/production+eng/journal/170
Citation
International Journal Of Advanced Manufacturing Technology, 2009, v. 41 n. 9-10, p. 972-985 How to Cite?
AbstractThis 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. © 2008 Springer-Verlag London Limited.
Persistent Identifierhttp://hdl.handle.net/10722/129240
ISSN
2015 Impact Factor: 1.568
2015 SCImago Journal Rankings: 0.915
ISI Accession Number ID
Funding AgencyGrant Number
National Natural Science Foundation of China50605050
China Ministry of EducationNCET-04-0928
Funding Information:

Special thanks are due to Professor Huang of The University of Hong Kong for his gracious supervision of this work. Gratitude is also extended to the National Natural Science Foundation of China (Grant No.: 50605050), the Program for New Century Excellent Talents in University by China Ministry of Education (Grant No.: NCET-04-0928) for the financial supports.

References

 

DC FieldValueLanguage
dc.contributor.authorZhou, Gen_HK
dc.contributor.authorJiang, Pen_HK
dc.contributor.authorHuang, GQen_HK
dc.date.accessioned2010-12-23T08:33:56Z-
dc.date.available2010-12-23T08:33:56Z-
dc.date.issued2009en_HK
dc.identifier.citationInternational Journal Of Advanced Manufacturing Technology, 2009, v. 41 n. 9-10, p. 972-985en_HK
dc.identifier.issn0268-3768en_HK
dc.identifier.urihttp://hdl.handle.net/10722/129240-
dc.description.abstractThis 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. © 2008 Springer-Verlag London Limited.en_HK
dc.languageengen_US
dc.publisherSpringer U K. The Journal's web site is located at http://www.springer.com/engineering/production+eng/journal/170en_HK
dc.relation.ispartofInternational Journal of Advanced Manufacturing Technologyen_HK
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectGenetic algorithmen_HK
dc.subjectJob schedulingen_HK
dc.subjectNash equilibriumen_HK
dc.subjectNetworked manufacturingen_HK
dc.subjectNon-cooperative gameen_HK
dc.titleA game-theory approach for job scheduling in networked manufacturingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0268-3768&volume=41&issue=9-10&spage=972&epage=985&date=2009&atitle=A+game-theory+approach+for+job+scheduling+in+networked+manufacturing-
dc.identifier.emailHuang, GQ:gqhuang@hkucc.hku.hken_HK
dc.identifier.authorityHuang, GQ=rp00118en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s00170-008-1539-9en_HK
dc.identifier.scopuseid_2-s2.0-63049116577en_HK
dc.identifier.hkuros178674en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-63049116577&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume41en_HK
dc.identifier.issue9-10en_HK
dc.identifier.spage972en_HK
dc.identifier.epage985en_HK
dc.identifier.isiWOS:000264330700014-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridZhou, G=35188416000en_HK
dc.identifier.scopusauthoridJiang, P=7201470064en_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats