Task splitting for three machine preemptive scheduling

DOI10.1007/BF00383199MaRDI QIDQ1177707zbMATH OpenFDO

Authors S. Singh

Publication date 26 June 1992

Published in Order (Search for Journal in Brave)

zbMATH Keywords

posetspreemptive scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• Scheduling multiprocessor tasks on three dedicated processors
• scientific article; zbMATH DE number 5525401
• Scheduling three chains on two parallel machines
• An approximation algorithm for scheduling on three dedicated machines
• Parallel machine scheduling with splitting jobs
• Scheduling Jobs on Several Machines with the Job Splitting Property
• Preemptive online algorithms for scheduling on three machines with hierarchies
• scientific article; zbMATH DE number 2219502

Cites work

• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• Optimal scheduling for two-processor systems
• Rational preemptive scheduling

Cited in

(3)

• Scheduling multiprocessor tasks on three dedicated processors
• scientific article; zbMATH DE number 5525401 (Why is no real title available?)
• Scheduling three chains on two parallel machines

This page was built for publication: Task splitting for three machine preemptive scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177707)