Scheduling independent two processor tasks on a uniform duo-processor system
DOI10.1016/0166-218X(90)90090-YzbMATH Open0715.90069OpenAlexW2018494064WikidataQ57387914 ScholiaQ57387914MaRDI QIDQ751995FDOQ751995
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
Recommendations
- scientific article
- 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
- 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
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60) Distributed algorithms (68W15)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Deadline scheduling of multiprocessor tasks
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Scheduling independent 2-processor tasks to minimize schedule length
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- 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)
