Sequencing and Cooperation

• Published in: Operations research Vol. 42; no. 3; pp. 566 - 568
• Main Authors: Curiel, Imma, Potters, Jos, Prasad, Rajendra, Tijs, Stef, Veltman, Bart
• Format: Journal Article
• Language: English
• Published: Baltimore, Md INFORMS 01-05-1994; Operations Research Society of America; Institute for Operations Research and the Management Sciences
• Subjects: Cooperation; Cooperative games; cooperative: Methods used to find far cost allocations; Cost allocation; Cost savings; deterministic; games/group decisions; Job shops; Operations research; Production scheduling; Scheduling; Sequencing; Sequential scheduling; single machine: cost distribution under additive regular criteria; Studies; Technical Notes
• ISSN: 0030-364X; 1526-5463
• DOI: 10.1287/opre.42.3.566

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.