Pages that link to "Item:Q3156827"
From MaRDI portal
The following pages link to A competitive scheduling problem and its relevance to UMTS channel assignment (Q3156827):
Displaying 20 items.
- Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Multi-agent single machine scheduling (Q2480197) (← links)
- Packet scheduling in third-generation mobile systems with UTRA-TDD air interface (Q2480204) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
- Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
