Online scheduling of jobs with favorite machines

DOI10.1016/j.cor.2019.104868zbMath1458.90275arXiv1812.01343OpenAlexW2995558816WikidataQ126555260 ScholiaQ126555260MaRDI QIDQ2289948

Paolo Penna, Cong Chen, Yin-Feng Xu

Publication date: 27 January 2020

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01343

zbMATH Keywords

schedulingcompetitive ratioonline schedulingunrelated machinesfavorite machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Online scheduling with deterioration and unexpected processor breakdown ⋮ Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ An optimal online algorithm for single-processor scheduling problem with learning effect ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• Unnamed Item
• Unnamed Item
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity
• Mechanisms for scheduling with single-bit private values
• On-line load balancing made simple: greedy strikes back
• On-line scheduling of two parallel machines with a single server
• New algorithms for an ancient scheduling problem.
• Scheduling problems on two sets of identical machines
• On-line scheduling revisited
• Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy
• Online scheduling of two job types on a set of multipurpose machines with unit processing times
• Selfish load balancing for jobs with favorite machines
• On-Line Load Balancing in a Hierarchical Server Topology
• ONLINE SCHEDULING OF MIXED CPU-GPU JOBS
• Mechanism Design for Decentralized Online Machine Scheduling
• Competitive Two-Agent Scheduling and Its Applications
• Bounds for List Schedules on Uniform Processors
• Better Bounds for Online Scheduling
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• A Better Algorithm for an Ancient Scheduling Problem
• On-Line Load Balancing for Related Machines
• Bounds for Certain Multiprocessing Anomalies
• Makespan minimization in online scheduling with machine eligibility
• Randomized on-line scheduling on two uniform machines

This page was built for publication: Online scheduling of jobs with favorite machines