Scheduling two agent task chains with a central selection mechanism
From MaRDI portal
Recommendations
Cites work
- A competitive scheduling problem and its relevance to UMTS channel assignment
- A multiple-criterion model for machine scheduling
- A note on an open-end bin packing problem
- Auction protocols for decentralized scheduling
- Competitive subset selection with two agents
- Computing the Nash solution for scheduling bargaining problems
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Multi-agent single machine scheduling
- Multiagent scheduling. Models and algorithms
- Multicriteria scheduling problems: a survey
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Scheduling aircraft landings using airlines' preferences
- Scheduling Problems with Two Competing Agents
- Single-machine multi-agent scheduling problems with a global objective function
- Strategies in competing subset selection
- Subset Weight Maximization with Two Competing Agents
- The Subset Sum game
- Two agent scheduling with a central selection mechanism
- Two agents competing for a shared machine
Cited in
(6)- 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
- Two agents competing for a shared machine
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
This page was built for publication: Scheduling two agent task chains with a central selection mechanism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356118)