Abstract
Game theoretic analysis of sequencing situations has been restricted to manufacturing 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. To analyze the allocation problem at hand, it focusses on the existence of core elements, convexity, and the Shapley value.
Original language | English |
---|---|
Pages (from-to) | 405-415 |
Journal | Journal of Scheduling |
Volume | 16 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2013 |