APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS

DOI10.15807/jorsj.31.61zbMath0645.90038OpenAlexW2186985741MaRDI QIDQ3789320

Kazumiti Numata

Publication date: 1988

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.31.61

zbMATH Keywords

independent tasksapproximate algorithmworst-case performance ratiounrelated processorsno preemption

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Approximation algorithms for scheduling unrelated parallel machines ⋮ A cutting plane algorithm for the unrelated parallel machine scheduling problem

This page was built for publication: APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS