Scheduling independent two processor tasks on a uniform duo-processor system

DOI10.1016/0166-218X(90)90090-YMaRDI QIDQ751995zbMATH OpenOpenAlexWikidataFDO

Authors Jacek Blazewicz, Dominique De Werra, M. Drozdowski, Günter Schmidt

Publication date 1990

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(90)90090-y

zbMATH Keywords

polynomial-time algorithmpreemptive schedulingscheduling multiprocessor tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4089308
• Scheduling independent 2-processor tasks to minimize schedule length
• Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
• Scheduling Independent Tasks on Uniform Processors
• scientific article; zbMATH DE number 1185302
• Scheduling multiprocessor tasks on two parallel processors
• Scheduling UET task systems with concurrency on two parallel identical processors
• An approximation result for a duo-processor task scheduling problem
• Optimal scheduling for two-processor systems
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors

Cites work

• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• Preemptive Scheduling of Uniform Processor Systems
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent 2-processor tasks to minimize schedule length
• Scheduling on semi-identical processors

Cited in

(10)

• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks with chain constraints
• Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
• An approximation result for a duo-processor task scheduling problem
• scientific article; zbMATH DE number 4089308 (Why is no real title available?)
• Scheduling independent 2-processor tasks to minimize schedule length
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Deadline scheduling of multiprocessor tasks
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• Scheduling chained multiprocessor tasks onto large multiprocessor system

This page was built for publication: Scheduling independent two processor tasks on a uniform duo-processor system

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