Proportionate flow shop games

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

    Research output: Contribution to JournalArticleAcademicpeer-review

    112 Downloads (Pure)

    Abstract

    In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines. By identifying jobs with agents whose costs linearly depend on the completion time of their jobs and assuming an initial processing order on the jobs, we face two problems: the first is how to obtain an optimal order that minimizes the total processing cost, the second is how to allocate the cost savings obtained by ordering the jobs optimally. In this paper we focus on the allocation problem. PFS games are defined as cooperative games associated to proportionate flow shop problems. It is seen that PFS games have a nonempty core. Moreover, it is shown that PFS games are convex if the jobs are initially ordered in decreasing urgency. For this case an explicit game independent expression for the Shapley value is provided. © 2007 Springer Science+Business Media, LLC.
    Original languageEnglish
    Pages (from-to)433-447
    JournalJournal of Scheduling
    Volume11
    DOIs
    Publication statusPublished - 2008

    Fingerprint

    Dive into the research topics of 'Proportionate flow shop games'. Together they form a unique fingerprint.

    Cite this