Sequencing and Cooperation

Imma Curiel, Jos Potters, Rajendra Prasad, Stef Tijs and Bart Veltman
Additional contact information
Imma Curiel: University of Maryland, Baltimore County, Cantonsville, Maryland
Jos Potters: University of Nijmegen, Nijmegen, The Netherlands
Rajendra Prasad: Indian Statistical Institute, Bangalore, India
Stef Tijs: Tilburg University, Tilburg, The Netherlands
Bart Veltman: Center for Mathematics and Computer Science, Amsterdam, The Netherlands

Operations Research, 1994, vol. 42, issue 3, 566-568

Abstract: In machine scheduling the first problem is to find a timetable that is optimal with respect to some efficiency criterion. If the jobs come from different clients the solution of the optimization problem is not the end of the story. In addition, we have to decide how the minimal total cost must be distributed among the parties involved. In this note, cost allocation problems will be considered to arise from one-machine scheduling problems with an additive and weakly increasing cost function. We will show that the cooperative games related to these cost allocation problems have a nonempty core. Furthermore, we give a rule that assigns a core element of the associated cost saving game to each scheduling problem of this kind and an initial order of the jobs.

Keywords: games/group decisions; cooperative: Methods used to find far cost allocations; production/scheduling; sequencing; deterministic; single machine: cost distribution under additive regular criteria (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (51)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.42.3.566 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:42:y:1994:i:3:p:566-568

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().