On competitive analysis for polling systems (Q6072151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The third comprehensive survey on scheduling problems with setup times/costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The significance of reducing setup times/setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Elevator polling with globally gated regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable Performance of Blind Policies in Heavy Traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: DELAYS AT SIGNALIZED INTERSECTIONS WITH EXHAUSTIVE TRAFFIC CONTROL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient visit orders for polling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of Markovian polling systems with single buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An online algorithm for a problem in scheduling with set-ups and release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line single-machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3117020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐Armed Bandit Allocation Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for single-machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-queue Markovian polling systems with exhaustive service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal polling policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of on-line scheduling algorithms to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polling-Systems-Based Autonomous Vehicle Coordination in Traffic Intersections With No Traffic Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing flow-time on a single machine with integer batch sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average completion time in the presence of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the flexible job shop scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of preemptive single-machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for on-line scheduling problems: How low can't you go? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queuing analysis of polling models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polling models with multi-phase gated service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative approximation of \(k\)-limited polling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical methods to study the polling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Tail-Optimal Scheduling Possible? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean value analysis for polling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Machine Scheduling with Family Setups / rank
 
Normal rank

Latest revision as of 05:18, 3 August 2024

scientific article; zbMATH DE number 7749635
Language Label Description Also known as
English
On competitive analysis for polling systems
scientific article; zbMATH DE number 7749635

    Statements

    On competitive analysis for polling systems (English)
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    competitive ratio
    0 references
    online algorithm
    0 references
    parallel queues with setup times
    0 references
    scheduling
    0 references
    worst-case analysis
    0 references
    0 references

    Identifiers