Maximum latency scheduling problem on two-person cooperative games

DOI10.1007/s10878-011-9434-yzbMath1273.91033MaRDI QIDQ358650

Jing Fan, Jiaofei Zhong, Guochun Tang, Yanhong Gu

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9434-y

zbMATH Keywords

scheduling; dynamic programming algorithm; cooperative profits; two-person cooperative game

Mathematics Subject Classification ID

91A12: Cooperative games

91A05: 2-person games

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

Quadratic kernel-free least squares support vector machine for target diseases classification, A two-stage method for member selection of emergency medical service, Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process, Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date, An integrated method to solve the healthcare facility layout problem under area constraints, A combinatorial auction mechanism for surgical scheduling considering surgeon's private availability information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nash bargaining theory when the number of alternatives can be finite
• A multiple-criterion model for machine scheduling
• An axiomatization of the Kalai-Smorodinsky solution when the feasible sets can be finite
• The Bargaining Problem
• Scheduling Problems with Two Competing Agents
• Two-Person Cooperative Games