Pages that link to "Item:Q954945"
From MaRDI portal
The following pages link to On-line scheduling of parallel jobs on two machines (Q954945):
Displaying 28 items.
- On-line scheduling on parallel machines to minimize the makespan (Q328085) (← links)
- On-line two-machine job shop scheduling with time lags (Q763542) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- On-line scheduling of two parallel machines with a single server (Q960401) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- Partial servicing of on-line jobs (Q1348740) (← links)
- A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density (Q1370302) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- On an on-line scheduling problem for parallel jobs (Q1603586) (← links)
- Online over time processing of combinatorial problems (Q1617394) (← links)
- Online MapReduce processing on two identical parallel machines (Q1698073) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979) (← links)
- Online scheduling of parallel jobs with preemption on two identical machines (Q1949689) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES (Q3063612) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines (Q3455878) (← links)
- A Greedy On-Line Algorithm for thek-Track Assignment Problem (Q4240132) (← links)
- (Q4364629) (← links)
- Structural Information and Communication Complexity (Q5315235) (← links)