Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Multiprocessor Scheduling Problem
In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (≥ 1) identical processors connected by a complete network. The objective of this survey is to give a panoramic view of theoretical and/or practical approaches for solving the problem, that have been extensively conducted during the past three decades. key words: multipr...
متن کاملApproximation algorithms for combinatorial optimization under uncertainty
Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in production planning, transportation, and communication network design. Whereas in the context of classical discrete optimization it is usually assumed that the problem inputs are known, in many real-world applications some of the data may be subject to an uncertainty, often bec...
متن کاملApproximation algorithms for the multiprocessor open shop scheduling problem
We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...
متن کاملTardiness Bounds for Global Multiprocessor Scheduling Algorithms
From 10.02. to 15.02., the Dagstuhl Seminar 08071 Scheduling was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together ...
متن کاملBarely Random Algorithms for Multiprocessor Scheduling
We present randomized online algorithms for scheduling on m = 3; : : : ; 7 machines. For two machines, a randomized algorithm achieving a competitive ratio of 4 3 was found by Bartal, Fiat, Karloo and Vohra 3]. These same authors show a matching lower bound. Seiden has presented a randomized algorithm which achieves competitive ratios of 1. A barely random algorithm is one which a distribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2010
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-010-9250-2