APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS

DOI10.15807/JORSJ.31.61MaRDI QIDQ3789320zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximate algorithmindependent tasksno preemptionunrelated processorsworst-case performance ratio

Mathematics Subject Classification ID

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

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

Cited in

(22)

• Worst-case analysis of a scheduling algorithm
• A new performance measure for scheduling independent real-time tasks
• Scheduling independent multiprocessor tasks on a uniform k-processor system
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Little-preemptive scheduling on unrelated processors
• Scheduling of conditional executed jobs on unrelated processors
• Scheduling imprecise computation tasks on uniform processors
• scientific article; zbMATH DE number 3914068 (Why is no real title available?)
• scientific article; zbMATH DE number 3978800 (Why is no real title available?)
• PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS
• scientific article; zbMATH DE number 1375583 (Why is no real title available?)
• Algorithms for Scheduling Independent Tasks
• scientific article; zbMATH DE number 1234084 (Why is no real title available?)
• scientific article; zbMATH DE number 516785 (Why is no real title available?)
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• scientific article; zbMATH DE number 1759466 (Why is no real title available?)
• Experimental and Efficient Algorithms
• An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
• Scheduling tasks on unrelated machines: large neighborhood improvement procedures
• Fast exact and approximate algorithms for k-partition and scheduling independent tasks
• Runtime performance of evolutionary algorithms for the chance-constrained makespan scheduling problem
• Approximation algorithms for scheduling unrelated parallel machines

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)