Scheduling Parallel Machines On-Line
From MaRDI portal
Publication:4862799
Recommendations
Cited in
(64)- Idle regulation in non-clairvoyant scheduling of parallel jobs
- On truthfulness and approximation for scheduling selfish tasks
- Optimal and online preemptive scheduling on uniformly related machines
- Dynamic scheduling on parallel machines
- Scheduling on identical machines: How good is LPT in an on-line setting?
- The optimal on-line parallel machine scheduling
- Fairness in parallel job scheduling
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- On-line scheduling with precedence constraints
- On an on-line scheduling problem for parallel jobs
- A note on on-line scheduling with precedence constraints on identical machines
- A survey on makespan minimization in semi-online environments
- Online C-benevolent job scheduling on multiple machines
- A note on on-line scheduling with partial information
- Online parallel machine scheduling to maximize the number of early jobs
- A comment on scheduling on uniform machines under chain-type precedence constraints
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Online scheduling with equal processing times and machine eligibility constraints
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- A system-centric metric for the evaluation of online job schedules
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- Utilization of nonclairvoyant online schedules
- Speed scaling for maximum lateness
- An online scheduling of two type parallel jobs on identical machines
- On-line scheduling on parallel machines to minimize the makespan
- An improved monotone algorithm for scheduling related machines with precedence constraints
- scientific article; zbMATH DE number 1235242 (Why is no real title available?)
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
- scientific article; zbMATH DE number 1930822 (Why is no real title available?)
- Online optimization of busy time on parallel machines
- Truthful prompt scheduling for minimizing sum of completion times
- An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE
- On-line scheduling of parallel jobs
- Structural Information and Communication Complexity
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
- Approximation and Online Algorithms
- Makespan minimization in online scheduling with machine eligibility
- Makespan minimization in online scheduling with machine eligibility
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Online strip packing with modifiable boxes
- On-line scheduling of parallel jobs with runtime restrictions
- On-line single-server dial-a-ride problems
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Machine learning-based online scheduling in distributed computing
- Tight bounds for selfish and greedy load balancing
- Measuring and evaluating the multi-compartment vehicle routing problem in dynamic environment using two hybrid meta-heuristics approaches
- Fifty years of research in scheduling -- theory and applications
- Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan
- Non-clairvoyant makespan minimization scheduling with predictions
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Scheduling on identical machines with setup time and unknown execution time
- Polytope scheduling with groups: unified models and optimal guarantees
- Resource scheduling with variable requirements over time
- On-line service scheduling
- Scheduling with conflicts: Online and offline algorithms
- On-line scheduling mesh jobs with dependencies
- Approximating call-scheduling makespan in all-optical networks
- Scheduling parallel jobs to minimize the makespan
- On-line scheduling of parallel jobs in a list
- Online scheduling of malleable parallel jobs with setup times on two identical machines
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)
