Scheduling two agent task chains with a central selection mechanism

DOI10.1007/s10951-014-0414-9zbMath1320.90020MaRDI QIDQ2356118

Ulrich Pferschy, Alessandro Agnetis, Andrea Pacifici, Gaia Nicosia

Publication date: 28 July 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0414-9

zbMATH Keywords

computational complexity; scheduling; bicriteria optimization; multi-agent optimization; best response

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

Related Items

Robust single machine scheduling with a flexible maintenance activity, Competitive multi-agent scheduling with an iterative selection rule, The price of fairness for a two-agent scheduling game minimizing total completion time, Two agent scheduling with a central selection mechanism

Cites Work

• The Subset Sum game
• Strategies in competing subset selection
• Competitive subset selection with two agents
• Computing the Nash solution for scheduling bargaining problems
• Two agent scheduling with a central selection mechanism
• Single-machine multi-agent scheduling problems with a global objective function
• A multiple-criterion model for machine scheduling
• Multi-agent single machine scheduling
• Scheduling aircraft landings using airlines' preferences
• Multicriteria scheduling problems: a survey
• Two Agents Competing for a Shared Machine
• Coordination Mechanisms for Selfish Parallel Jobs Scheduling
• A competitive scheduling problem and its relevance to UMTS channel assignment
• Scheduling Problems with Two Competing Agents
• Subset Weight Maximization with Two Competing Agents
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Multiagent Scheduling
• Auction protocols for decentralized scheduling
• A note on an open-end bin packing problem