Makespan minimization for two parallel machines with unavailability constraints

2016 ◽  
Author(s):  
Khaoula Ben Abdellafou ◽  
Ouajdi Korbaa
Keyword(s):  
Parallel Machines ◽  
Makespan Minimization ◽  
Unavailability Constraints

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.

Sign in / Sign up

Export Citation Format

Share Document