Cooperation in a single-machine scheduling problem with job deterioration
In this paper we consider a single-machine scheduling problem with job deterioration,which is solved by a game theory approach.The problem considered is to find the maximal cost savings of the grand coalition and divide the maximal cost savings.In this paper,we prove that the cooperative game is convex and an allocation rule to divide the maximal cost savings is proposed.
scheduling cooperative game job deterioration
Feng Li Yang Yang
Liaoning Key Laboratory of Manufacturing System and Logistics,Institute of Industrial Engineering & Logistics Optimization,Northeastern University,Shenyang,110819,China
国际会议
重庆
英文
79-82
2016-03-20(万方平台首次上网日期,不代表论文的发表时间)