On a new class of parallel sequencing situations and related games

被引：26

作者：

Calleja, P

Borm, P

Hamers, H

Klijn, F

Slikker, M

机构：

[1] Univ Barcelona, Dept Econ Financial & Actuarial Math, Barcelona 08034, Spain

[2] Tilburg Univ, CentER, NL-5000 LE Tilburg, Netherlands

[3] Tilburg Univ, Dept Econometr & Operat Res, NL-5000 LE Tilburg, Netherlands

[4] Univ Vigo, Dept Estadist & Invest Operat, Vigo 36310, Spain

[5] Eindhoven Univ Technol, Dept Business Econ & Mkt, NL-5600 MB Eindhoven, Netherlands

来源：

ANNALS OF OPERATIONS RESEARCH | 2002年 / 109卷 / 1-4期

关键词：

cooperative game theory; scheduling; balancedness;

D O I：

10.1023/A:1016360404530

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine. The costs of an agent depend linearly on the final completion time of his jobs. We describe a procedure that provides an optimal processing order of the jobs for some particular classes. Furthermore, we study cooperative games arising from these sequencing situations. Our main result will be on the balancedness of these games.

引用

页码：265 / 277

页数：13

共 10 条

[1]

[Anonymous], 1995, MATH PROGRAM

[2] On the convexity of games corresponding to sequencing situations with due dates [J].