Scheduling independent 2-processor tasks to minimize schedule length

DOI10.1016/0020-0190(84)90006-1zbMath0544.68032OpenAlexW1981443073WikidataQ57387935 ScholiaQ57387935MaRDI QIDQ796987

M. Drabowski, Jacek Błażewicz, Jan Weglarz

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

zbMATH Keywords

polynomial-time algorithmdeterministic schedulingmultiprocessor tasksidentical processors

Mathematics Subject Classification ID

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

Related Items

The complexity of scheduling independent two-processor tasks on dedicated processors, Scheduling chained multiprocessor tasks onto large multiprocessor system, Scheduling of resource tasks, Scheduling independent two processor tasks on a uniform duo-processor system, Scheduling multiprocessor tasks -- An overview, Scheduling multiprocessor tasks with chain constraints, Linear and quadratic algorithms for scheduling chains and opposite chains

Cites Work

• Characterization of Connection Assignment of Diagnosable Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item