A competitive scheduling problem and its relevance to UMTS channel assignment
From MaRDI portal
Publication:3156827
DOI10.1002/net.20023zbMath1055.90031OpenAlexW1982445253MaRDI QIDQ3156827
Claudio Arbib, Stefano Smriglio, Mara Servilio
Publication date: 12 January 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20023
Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (18)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Approximation schemes for two-machine flow shop scheduling with two agents ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ Multi-agent single machine scheduling ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A Lagrangian approach to single-machine scheduling problems with two competing agents ⋮ Approximation algorithms for multi-agent scheduling to minimize total weighted completion time ⋮ Scheduling two chains of unit jobs on one machine: A polyhedral study ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ Scheduling two agent task chains with a central selection mechanism
Cites Work
This page was built for publication: A competitive scheduling problem and its relevance to UMTS channel assignment
