Scheduling independent 2-processor tasks to minimize schedule length
DOI10.1016/0020-0190(84)90006-1zbMATH Open0544.68032DBLPjournals/ipl/BlazewiczWD84OpenAlexW1981443073WikidataQ57387935 ScholiaQ57387935MaRDI QIDQ796987FDOQ796987
M. Drabowski, Jacek Blazewicz, Jan Węglarz
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(84)90006-1
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (14)
- Linear and quadratic algorithms for scheduling chains and opposite chains
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Two-way dominant sequence clustering for processor scheduling
- Scheduling independent two processor tasks on a uniform duo-processor system
- Two processor scheduling with limited preemption
- Scheduling chained multiprocessor tasks onto large multiprocessor system
- Scheduling of resource tasks
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
This page was built for publication: Scheduling independent 2-processor tasks to minimize schedule length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796987)