Processing games with restricted capacities

DOI10.1016/J.EJOR.2009.06.014MaRDI QIDQ1041002zbMATH OpenOpenAlexFDO

Authors Hans Reijnierse, Marieke Quant, Marc Meertens, Peter Borm

Publication date 27 November 2009

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://research.tilburguniversity.edu/en/publications/a769e434-b8c9-4116-8897-f4332ba50029

zbMATH Keywords

cooperationschedulingcore allocationindividual capacity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Cooperative games (91A12) Experimental studies (91A90)

Recommendations

• Processing games with shared interest
• Capacity allocation games without an initial sequence
• Two-person cooperative games on processing jobs with due date
• Cores of games with restricted cooperation
• Sequencing games with controllable processing times

Cites work

• scientific article; zbMATH DE number 3307201 (Why is no real title available?)
• A characterization of the Shapley value in queueing problems
• Balancedness of permutation games and envy-free allocations in indivisible good economies
• Economies with land -- A game theoretical approach
• Operations research games: A survey. (With comments and rejoinder)
• Processing games with shared interest
• Sequencing games

Cited in

(3)

• Two-person cooperative games on processing jobs with due date
• Component acquisition games
• Processing games with shared interest

This page was built for publication: Processing games with restricted capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041002)