Online Makespan Minimization with Budgeted Uncertainty

2021 ◽  
pp. 43-56
Author(s):  
Susanne Albers ◽  
Maximilian Janke
Keyword(s):  
Makespan Minimization ◽  
Budgeted Uncertainty

scholarly journals Approximation Results for Makespan Minimization with Budgeted Uncertainty

2021 ◽  
Author(s):  
Marin Bougeret ◽  
Klaus Jansen ◽  
Michael Poss ◽  
Lars Rohwedder
Keyword(s):  
Makespan Minimization ◽  
Budgeted Uncertainty

scholarly journals Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

2011 ◽  
Vol 2011 ◽  
pp. 1-20 ◽  
Author(s):  
M. Bouznif ◽  
R. Giroudeau
Keyword(s):  
Approximation Algorithm ◽  
Large Class ◽  
Bipartite Graph ◽  
Polynomial Time ◽  
Performance Guarantee ◽  
Makespan Minimization ◽  
Time Approximation ◽  
Polynomial Time Approximation Algorithm ◽  
Precedence Graph ◽  
Polynomial Time Approximation

We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fixed diameter . We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time -approximation algorithm for the makespan minimization on processor networks with diameter .

scholarly journals A characterization of optimal multiprocessor schedules and new dominance rules

2020 ◽  
Vol 40 (4) ◽  
pp. 876-900
Author(s):  
Rico Walter ◽  
Alexander Lawrinenko
Keyword(s):  
Parallel Machines ◽  
Computational Study ◽  
Search Space ◽  
Point Of View ◽  
Theoretical Point ◽  
Optimal Solutions ◽  
Identical Parallel Machines ◽  
Makespan Minimization ◽  
Structural Pattern

Abstract The paper on hand approaches the classical makespan minimization problem on identical parallel machines from a rather theoretical point of view. Using an approach similar to the idea behind inverse optimization, we identify a general structural pattern of optimal multiprocessor schedules. We also show how to derive new dominance rules from the characteristics of optimal solutions. Results of our computational study attest to the efficacy of the new rules. They are particularly useful in limiting the search space when each machine processes only a few jobs on average.

Remarks on the makespan minimization problem

1984 ◽  
Vol 8 (3-4) ◽  
pp. 193-195
Author(s):  
Michael A. Langston
Keyword(s):  
Minimization Problem ◽  
Makespan Minimization
Sign in / Sign up

Export Citation Format

Share Document