TY - JOUR
T1 - Costing-based coordination between mt-iPSS customer and providers for job shop production using game theory
AU - Mu, Hui
AU - Jiang, Pingyu
AU - Leng, Jiewu
N1 - Publisher Copyright:
© 2016 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2017/1/17
Y1 - 2017/1/17
N2 - The industrial product-service system for Computer Numerical Control machine tool (mt-iPSS) has drawn much interest. Under the new paradigm of functional result-oriented mt-iPSS, mt-iPSS customer (i.e. owner of the workshop) pays for time or results of mt-iPSS providers. The present problem for mt-iPSS customer is how to timely identify the optimal machine tools, sequence and cutting parameters of operation to finish the jobs while mt-iPSS providers try to maximise their benefit in a non-cooperative game structure. In this paper, a Stackelberg game model is put forward to solve the coordination problem based on the costing of different job shop scheduling solutions under the result-oriented mt-iPSS paradigm. Then, to solve the established bi-level programming model of the Stackelberg game, a solution procedure based on hierarchical particle swarm optimisation is proposed. Finally, a case from a printing machinery enterprise is analysed to validate the proposed model. This research is expected to improve the quality and effectiveness of coordination for scheduling and process planning decision between mt-iPSS customer and multi-providers.
AB - The industrial product-service system for Computer Numerical Control machine tool (mt-iPSS) has drawn much interest. Under the new paradigm of functional result-oriented mt-iPSS, mt-iPSS customer (i.e. owner of the workshop) pays for time or results of mt-iPSS providers. The present problem for mt-iPSS customer is how to timely identify the optimal machine tools, sequence and cutting parameters of operation to finish the jobs while mt-iPSS providers try to maximise their benefit in a non-cooperative game structure. In this paper, a Stackelberg game model is put forward to solve the coordination problem based on the costing of different job shop scheduling solutions under the result-oriented mt-iPSS paradigm. Then, to solve the established bi-level programming model of the Stackelberg game, a solution procedure based on hierarchical particle swarm optimisation is proposed. Finally, a case from a printing machinery enterprise is analysed to validate the proposed model. This research is expected to improve the quality and effectiveness of coordination for scheduling and process planning decision between mt-iPSS customer and multi-providers.
KW - coordination decision
KW - job shop scheduling
KW - operational research
KW - product service systems
KW - Stackelberg game
UR - https://www.scopus.com/pages/publications/84966713774
U2 - 10.1080/00207543.2016.1184347
DO - 10.1080/00207543.2016.1184347
M3 - 文章
AN - SCOPUS:84966713774
SN - 0020-7543
VL - 55
SP - 430
EP - 446
JO - International Journal of Production Research
JF - International Journal of Production Research
IS - 2
ER -