Scheduling Parallel Machines On-Line
From MaRDI portal
Publication:4862799
DOI10.1137/S0097539793248317zbMATH Open0845.68042MaRDI QIDQ4862799FDOQ4862799
Authors: David B. Shmoys, David P. Williamson, Joel Wein 
Publication date: 15 September 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Discrete mathematics in relation to computer science (68R99)
Cited In (55)
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Speed scaling for maximum lateness
- Makespan minimization in online scheduling with machine eligibility
- Utilization of nonclairvoyant online schedules
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- A note on on-line scheduling with precedence constraints on identical machines
- Online strip packing with modifiable boxes
- On-line scheduling of parallel jobs with runtime restrictions
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE
- An improved monotone algorithm for scheduling related machines with precedence constraints
- On-line single-server dial-a-ride problems
- Resource scheduling with variable requirements over time
- Approximation and Online Algorithms
- On truthfulness and approximation for scheduling selfish tasks
- Online C-benevolent job scheduling on multiple machines
- A survey on makespan minimization in semi-online environments
- Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
- On-line scheduling of parallel jobs
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- On-line scheduling on a single machine: Maximizing the number of early jobs
- An online scheduling of two type parallel jobs on identical machines
- A note on on-line scheduling with partial information
- Tight bounds for selfish and greedy load balancing
- An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- On-line scheduling mesh jobs with dependencies
- Idle regulation in non-clairvoyant scheduling of parallel jobs
- Approximating call-scheduling makespan in all-optical networks
- On-line service scheduling
- Online scheduling with equal processing times and machine eligibility constraints
- Title not available (Why is that?)
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- On-line scheduling on parallel machines to minimize the makespan
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- On an on-line scheduling problem for parallel jobs
- Online optimization of busy time on parallel machines
- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Scheduling with conflicts: Online and offline algorithms
- Machine learning-based online scheduling in distributed computing
- On-line scheduling of parallel jobs in a list
- Scheduling parallel jobs to minimize the makespan
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Optimal and online preemptive scheduling on uniformly related machines
- Fairness in parallel job scheduling
- On-line scheduling with precedence constraints
- A system-centric metric for the evaluation of online job schedules
- A comment on scheduling on uniform machines under chain-type precedence constraints
- The optimal on-line parallel machine scheduling
- Makespan minimization in online scheduling with machine eligibility
- Structural Information and Communication Complexity
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
- Title not available (Why is that?)
- Online parallel machine scheduling to maximize the number of early jobs
This page was built for publication: Scheduling Parallel Machines On-Line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862799)
