On competitive analysis for polling systems
From MaRDI portal
Publication:6072151
DOI10.1002/nav.21926zbMath1523.90093arXiv2001.02530OpenAlexW3106126173MaRDI QIDQ6072151
Publication date: 12 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02530
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- On two-queue Markovian polling systems with exhaustive service
- An online algorithm for a problem in scheduling with set-ups and release times
- Competitive analysis of preemptive single-machine scheduling
- Approximation algorithms for scheduling unrelated parallel machines
- Mean value analysis for polling systems
- Iterative approximation of \(k\)-limited polling systems
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- On optimal polling policies
- On Elevator polling with globally gated regime
- Minimizing average completion time in the presence of release dates
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Polling models with multi-phase gated service
- A class of on-line scheduling algorithms to minimize total completion time
- Lower bounds for on-line single-machine scheduling.
- The hybrid flow shop scheduling problem
- Mathematical methods to study the polling systems
- The significance of reducing setup times/setup costs
- A survey of scheduling problems with setup times or costs
- Minimizing flow-time on a single machine with integer batch sizes
- Approximation Techniques for Average Completion Time Scheduling
- Single Machine Scheduling with Release Dates
- Online Machine Scheduling with Family Setups
- Multi‐Armed Bandit Allocation Indices
- Queuing analysis of polling models
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Efficient visit orders for polling systems
- Performance analysis of Markovian polling systems with single buffers
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Optimal on-line algorithms for single-machine scheduling
- Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
- Is Tail-Optimal Scheduling Possible?
- DELAYS AT SIGNALIZED INTERSECTIONS WITH EXHAUSTIVE TRAFFIC CONTROL
- A New Approach to Online Scheduling
- Polling-Systems-Based Autonomous Vehicle Coordination in Traffic Intersections With No Traffic Signals
- Achievable Performance of Blind Policies in Heavy Traffic
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: On competitive analysis for polling systems
