Showing 1 - 10 of 23
Persistent link: https://www.econbiz.de/10002263801
This paper analyzes processing problems and related cooperative games. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. There are no restrictions whatsoever on the processing...
Persistent link: https://www.econbiz.de/10014069042
Persistent link: https://www.econbiz.de/10003980994
Persistent link: https://www.econbiz.de/10002513183
A generalization of processing problems with restricted capacities is introduced. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. The new aspect is that players have interest...
Persistent link: https://www.econbiz.de/10014067776
Persistent link: https://www.econbiz.de/10003667164
Persistent link: https://www.econbiz.de/10002240098
This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output. Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...
Persistent link: https://www.econbiz.de/10014028825
This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a...
Persistent link: https://www.econbiz.de/10013106485
Persistent link: https://www.econbiz.de/10009777783