Game theoretic analysis of sequencing situations has been restricted to manufactur- ing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs. This paper aims to extend the game theoretical approach to the cost allocation problems arising from sequencing situations on systems that consist of batch machines. We first consider sequencing situations with a single batch machine and analyze cooperative games arising from these situations. It is shown that these games are convex and an expression for the Shapley value of these games is provided. We also introduce an equal gain splitting rule for these sequencing situa- tions and provide an axiomatic characterization. Second, we analyze various aspects of flow-shop sequencing situations which consist of batch machines only. In particular, we provide two cases in which the cooperative game arising from the flow-shop sequencing situation is equal to the game arising from a sequencing situation that corresponds to one specific machine in the flow-shop.
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
page. 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
2008-100.
References listed on IDEAS 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.: