APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
From MaRDI portal
Publication:3789320
DOI10.15807/JORSJ.31.61zbMATH Open0645.90038OpenAlexW2186985741MaRDI QIDQ3789320FDOQ3789320
Authors: 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
Recommendations
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
- scientific article; zbMATH DE number 1979517
- Scheduling Independent Tasks on Uniform Processors
- scientific article; zbMATH DE number 1375583
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- Approximating scheduling unrelated parallel machines in parallel
- scientific article; zbMATH DE number 1863269
- scientific article; zbMATH DE number 1979516
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cited In (20)
- Title not available (Why is that?)
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- Experimental and Efficient Algorithms
- Approximation algorithms for scheduling unrelated parallel machines
- Little-preemptive scheduling on unrelated processors
- Scheduling of conditional executed jobs on unrelated processors
- Title not available (Why is that?)
- Scheduling imprecise computation tasks on uniform processors
- A new performance measure for scheduling independent real-time tasks
- Title not available (Why is that?)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- Worst-case analysis of a scheduling algorithm
- Algorithms for Scheduling Independent Tasks
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789320)
