On a New Class of Parallel Sequencing Situations and Related Games

P. Calleja; P.E.M. Borm; H.J.M. Hamers; F. Klijn

On a New Class of Parallel Sequencing Situations and Related Games

P. Calleja, P.E.M. Borm, H.J.M. Hamers, F. Klijn

Research output: Working paper › Discussion paper › Other research output

Abstract

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.Furthermore, we study cooperative games arising from these sequencing situations.Our main result is balancedness of these games.

Original language	English
Place of Publication	Tilburg
Publisher	Operations research
Number of pages	29
Volume	2001-3
Publication status	Published - 2001

Publication series

Name	CentER Discussion Paper
Volume	2001-3

Keywords

cooperative games
scheduling

Access to Document

3

Fingerprint Dive into the research topics of 'On a New Class of Parallel Sequencing Situations and Related Games'. Together they form a unique fingerprint.

Cite this

@techreport{16a7563a18034a1d8b4644a52dea74a6,

title = "On a New Class of Parallel Sequencing Situations and Related Games",

abstract = "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.Furthermore, we study cooperative games arising from these sequencing situations.Our main result is balancedness of these games.",

keywords = "cooperative games, scheduling",

author = "P. Calleja and P.E.M. Borm and H.J.M. Hamers and F. Klijn",

note = "Pagination: 29",

year = "2001",

language = "English",

volume = "2001-3",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}

TY - UNPB

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.

N1 - Pagination: 29

PY - 2001

Y1 - 2001

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.Furthermore, we study cooperative games arising from these sequencing situations.Our main result is 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.Furthermore, we study cooperative games arising from these sequencing situations.Our main result is balancedness of these games.

KW - cooperative games

KW - scheduling

M3 - Discussion paper

VL - 2001-3

T3 - CentER Discussion Paper

BT - On a New Class of Parallel Sequencing Situations and Related Games

PB - Operations research

CY - Tilburg

ER -