Scheduling multiprocessor tasks with chain constraints

DOI10.1016/0377-2217(96)00126-9zbMATH Open0949.68505OpenAlexW2044262424WikidataQ57387869 ScholiaQ57387869MaRDI QIDQ1278298FDOQ1278298

Authors: Zhen Liu, Jacek Blazewicz 

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00126-9

Recommendations

• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• On the complexity of multiprocessor task scheduling
• Linear and quadratic algorithms for scheduling chains and opposite chains
• Scheduling three chains on two parallel machines

zbMATH Keywords

parallel computationschedulingprecedence constraintmultiprocessor task

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling subject to resource constraints: Classification and complexity
• Optimal scheduling for two-processor systems
• Scheduling with deadlines and loss functions
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Concurrent Task Systems
• Multiprocessor scheduling with communication delays
• Title not available (Why is that?)
• Title not available (Why is that?)
• On general routing problems
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of Scheduling Parallel Task Systems
• Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
• Scheduling independent two processor tasks on a uniform duo-processor system
• Scheduling independent 2-processor tasks to minimize schedule length

Cited In (15)

• Scheduling multiprocessor tasks on two parallel processors
• Linear and quadratic algorithms for scheduling chains and opposite chains
• Scheduling with semaphore constraints
• A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
• Approximation schemes for scheduling jobs with chain precedence constraints
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• CHAIN STRUCTURES IN SCHEDULES TASKS
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• Chains and trees: `Strong' -- `weak' order in job scheduling
• A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling
• Scheduling three chains on two parallel machines
• Scheduling chained multiprocessor tasks onto large multiprocessor system
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Packing-based branch-and-bound for discrete malleable task scheduling
• Scheduling Multiprocessor Tasks to Minimize Schedule Length

This page was built for publication: Scheduling multiprocessor tasks with chain constraints

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