File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Non-cooperation game for customer's competition driven job schedule

TitleNon-cooperation game for customer's competition driven job schedule
客户竞争驱动的任务调度非合作博弈
Authors
KeywordsGenetic Algorithm
Nash Equilibrium Point
Non-Cooperative Game
Task Schedule
Issue Date2006
PublisherChina Machine Press. The Journal's web site is located at http://www.cjmenet.com/
Citation
Jixie Gongcheng Xuebao/Chinese Journal Of Mechanical Engineering, 2006, v. 42 n. 7, p. 56-61 How to Cite?
機械工程學報, 2006, v. 42 n. 7, p. 56-61 How to Cite?
AbstractFrom the perspective of viewing customer competition requirements and on the basis of analyzing the goal of each manufacturing task submitted by correspondent customer maximizing its own payoffs (mainly focusing on the finishing time of each manufacturing task), together with the deficiency of traditional strategies, methods and models of task schedule, a non-cooperation game model with complete information for task schedule is presented and established. In this task scheduling model, the players correspond to the jobs submitted respectively by related customers, the strategies of each job correspond to the selectable geographical distributive machines related to the processes of this job, and the payoff of each job is defined as the reciprocal of its finishing time. So the optimal scheduling results is obtained by using the Nash equilibrium (NE) point of this game. In order to find the NE point, genetic algorithm is introduced. A numerical case study is given to demonstrate the feasibility of these methods.
Persistent Identifierhttp://hdl.handle.net/10722/155888
ISSN
2015 SCImago Journal Rankings: 0.544
References

 

DC FieldValueLanguage
dc.contributor.authorZhou, Gen_US
dc.contributor.authorJiang, Pen_US
dc.contributor.authorHuang, Gen_US
dc.date.accessioned2012-08-08T08:38:12Z-
dc.date.available2012-08-08T08:38:12Z-
dc.date.issued2006en_US
dc.identifier.citationJixie Gongcheng Xuebao/Chinese Journal Of Mechanical Engineering, 2006, v. 42 n. 7, p. 56-61en_US
dc.identifier.citation機械工程學報, 2006, v. 42 n. 7, p. 56-61-
dc.identifier.issn0577-6686en_US
dc.identifier.urihttp://hdl.handle.net/10722/155888-
dc.description.abstractFrom the perspective of viewing customer competition requirements and on the basis of analyzing the goal of each manufacturing task submitted by correspondent customer maximizing its own payoffs (mainly focusing on the finishing time of each manufacturing task), together with the deficiency of traditional strategies, methods and models of task schedule, a non-cooperation game model with complete information for task schedule is presented and established. In this task scheduling model, the players correspond to the jobs submitted respectively by related customers, the strategies of each job correspond to the selectable geographical distributive machines related to the processes of this job, and the payoff of each job is defined as the reciprocal of its finishing time. So the optimal scheduling results is obtained by using the Nash equilibrium (NE) point of this game. In order to find the NE point, genetic algorithm is introduced. A numerical case study is given to demonstrate the feasibility of these methods.en_US
dc.languagechien_US
dc.publisherChina Machine Press. The Journal's web site is located at http://www.cjmenet.com/-
dc.relation.ispartofJixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineeringen_US
dc.relation.ispartof機械工程學報-
dc.subjectGenetic Algorithmen_US
dc.subjectNash Equilibrium Pointen_US
dc.subjectNon-Cooperative Gameen_US
dc.subjectTask Scheduleen_US
dc.titleNon-cooperation game for customer's competition driven job scheduleen_US
dc.title客户竞争驱动的任务调度非合作博弈-
dc.typeArticleen_US
dc.identifier.emailHuang, G:gqhuang@hkucc.hku.hken_US
dc.identifier.authorityHuang, G=rp00118en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-33748465343en_US
dc.identifier.hkuros149752-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33748465343&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume42en_US
dc.identifier.issue7en_US
dc.identifier.spage56en_US
dc.identifier.epage61en_US
dc.publisher.placeChinaen_US
dc.identifier.scopusauthoridZhou, G=35188416000en_US
dc.identifier.scopusauthoridJiang, P=7201470064en_US
dc.identifier.scopusauthoridHuang, G=7403425048en_US
dc.customcontrol.immutablejt 130410-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats