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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
3.
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Estevez-Fernandez, Arantza & Mosquera, Manuel A. & Borm, Peter & Hamers, Herbert, 2006.
"Proportionate flow shop games,"
Discussion Paper
63, Tilburg University, Center for Economic Research.
[Downloadable!]
Did you know? You can include your works in the database easily by uploading them on the Munich Personal RePEc Archive (MPRA) if you do not have access to an institutional RePEc archive.