Linear and quadratic algorithms for scheduling chains and opposite chains

DOI10.1016/S0377-2217(01)00207-7MaRDI QIDQ1600834zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jacek Blazewicz, Zhen Liu

Publication date 16 June 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(01)00207-7

zbMATH Keywords

parallel computingschedulingchainmultiprocessor taskslevel algorithmpreemptive and nonpreemptive schedulinglargest-remaining-task algorithmopposite chain

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling multiprocessor tasks with chain constraints
• Scheduling chains to minimize mean flow time
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• UET-scheduling with chain-type precedence constraints

Cites work

• scientific article; zbMATH DE number 1640601 (Why is no real title available?)
• scientific article; zbMATH DE number 3780551 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 1016640 (Why is no real title available?)
• scientific article; zbMATH DE number 944424 (Why is no real title available?)
• scientific article; zbMATH DE number 226824 (Why is no real title available?)
• Complexity of Scheduling Parallel Task Systems
• Concurrent Task Systems
• Inequalities: theory of majorization and its applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent 2-processor tasks to minimize schedule length
• Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
• Scheduling multiprocessor tasks with chain constraints
• Scheduling with deadlines and loss functions

Cited in

(3)

• 1-optimality of static BSP computations: Scheduling independent chains as a case study.
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling chained multiprocessor tasks onto large multiprocessor system

This page was built for publication: Linear and quadratic algorithms for scheduling chains and opposite chains

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