TY - JOUR
T1 - On a new class of parallel sequencing situations and related games
AU - Calleja, P.
AU - Borm, P.E.M.
AU - Hamers, H.J.M.
AU - Klijn, F.
AU - Slikker, M.
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
U2 - 10.1023/A:1016360404530
DO - 10.1023/A:1016360404530
M3 - Article
SN - 0254-5330
VL - 109
SP - 265
EP - 277
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1-4
ER -