Pages that link to "Item:Q1949689"

The following pages link to Online scheduling of parallel jobs with preemption on two identical machines (Q1949689):

Displaying 16 items.

• Online MapReduce scheduling problem of minimizing the makespan (Q511710) (← links)
• Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
• Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
• Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
• On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
• Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
• On-line and off-line preemptive two-machine job shop scheduling (Q1592758) (← links)
• Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
• Online parallel machine scheduling to maximize the number of early jobs (Q1955379) (← links)
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times (Q2910573) (← links)
• Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
• Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (Q3453298) (← links)
• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs (Q5265640) (← links)
• Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
• Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms (Q6556180) (← links)