Pages that link to "Item:Q2434286"
From MaRDI portal
The following pages link to Single-machine multi-agent scheduling problems with a global objective function (Q2434286):
Displayed 17 items.
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- Complexities of four problems on two-agent scheduling (Q1653276) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- A subset-sum type formulation of a two-agent single-machine scheduling problem (Q2281162) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- An Ordered Flow Shop with Two Agents (Q5506757) (← links)
- (Q6097273) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)