SEQUENCING AND COOPERATION
成果类型：
Note
署名作者：
CURIEL, I; POTTERS, J; PRASAD, R; TIJS, S; VELTMAN, B
署名单位：
Radboud University Nijmegen; Indian Statistical Institute; Indian Statistical Institute Bangalore; Tilburg University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.42.3.566
发表日期：
1994
页码：
566-568
关键词：
摘要：
In machine scheduling the first problem is to find a timetable that is optimal with respect to some efficiency criterion. If the jobs come from different clients the solution of the optimization problem is not the end of the story. In addition, we have to decide how the minimal total cost must be distributed among the parties involved. In this note, cost allocation problems will be considered to arise from one-machine scheduling problems with an additive and weakly increasing cost function. We will show that the cooperative games related to these cost allocation problems have a nonempty core. Furthermore, we give a rule that assigns a core element of the associated cost saving game to each scheduling problem of this kind and an initial order of the jobs.