Sequencing Games with Repeated Players

M.A. Estevez Fernandez, P. Borm, P. Calleja, H. Hamers

    Research output: Contribution to JournalArticleAcademicpeer-review

    193 Downloads (Pure)

    Abstract

    Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations. In max-RP sequencing situations it is assumed that each player's cost function is linear with respect to the maximum completion time of his jobs, whereas in min-RP sequencing situations the cost functions are linear with respect to the minimum completion times. For both classes, following explicit procedures to go from the initial processing order to an optimal order for the coalition of all players, equal gain splitting rules are defined. It is shown that these rules lead to core elements of the associated RP sequencing games. Moreover, it is seen that min-RP sequencing games are convex. © 2007 Springer Science+Business Media, LLC.
    Original languageEnglish
    Pages (from-to)189-203
    JournalAnnals of Operations Research
    Volume158
    DOIs
    Publication statusPublished - 2008

    Fingerprint

    Dive into the research topics of 'Sequencing Games with Repeated Players'. Together they form a unique fingerprint.

    Cite this