Pages that link to "Item:Q4862799"
From MaRDI portal
The following pages link to Scheduling Parallel Machines On-Line (Q4862799):
Displayed 45 items.
- Speed scaling for maximum lateness (Q255271) (← links)
- On-line scheduling on parallel machines to minimize the makespan (Q328085) (← links)
- An improved monotone algorithm for scheduling related machines with precedence constraints (Q408428) (← links)
- Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Resource scheduling with variable requirements over time (Q835625) (← links)
- On-line service scheduling (Q835637) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- On-line scheduling mesh jobs with dependencies (Q870843) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- Idle regulation in non-clairvoyant scheduling of parallel jobs (Q1003681) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Scheduling on identical machines: How good is LPT in an on-line setting? (Q1382806) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- On an on-line scheduling problem for parallel jobs (Q1603586) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Online parallel machine scheduling to maximize the number of early jobs (Q1955379) (← links)
- A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643) (← links)
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051) (← links)
- Online scheduling on a parallel batch machine with delivery times and limited restarts (Q2136511) (← links)
- Online scheduling with equal processing times and machine eligibility constraints (Q2257291) (← links)
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones (Q2273650) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- Utilization of nonclairvoyant online schedules (Q2508980) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
- (Q5009585) (← links)
- An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (Q5024917) (← links)
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE (Q5076084) (← links)
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis (Q5323061) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)
- Online strip packing with modifiable boxes (Q5949922) (← links)
- On-line scheduling of parallel jobs with runtime restrictions (Q5958714) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling (Q6086005) (← links)