scholarly journals Scheduling on (Un-)Related Machines with Setup Times

2019 ◽  
Author(s):  
Klaus Jansen ◽  
Marten Maack ◽  
Alexander Macker
Keyword(s):  
Setup Times ◽  
Related Machines

scholarly journals Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

2020 ◽  
Author(s):  
Biswaroop Maiti ◽  
Rajmohan Rajaraman ◽  
David Stalfa ◽  
Zoya Svitkina ◽  
Aravindan Vijayaraghavan
Keyword(s):  
Communication Delay ◽  
Related Machines

scholarly journals Empowering the configuration-IP: new PTAS results for scheduling with setup times

2021 ◽  
Author(s):  
Klaus Jansen ◽  
Kim-Manuel Klein ◽  
Marten Maack ◽  
Malin Rau
Keyword(s):  
Approximation Scheme ◽  
Constant Factor ◽  
Setup Times ◽  
Linear Programs ◽  
Scheduling Problems ◽  
Design Of Algorithms ◽  
Packing Problems ◽  
Integer Linear Programs ◽  
One Machine ◽  
Target Locations

AbstractInteger linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems where a set of items has to be placed in multiple target locations. Herein, a configuration describes a possible placement on one of the target locations, and the IP is used to choose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of n-fold integer programming and, therefore, be solved efficiently. As an application, we consider scheduling problems with setup times in which a set of jobs has to be scheduled on a set of identical machines with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed, an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time $$f(1/\varepsilon )\cdot \mathrm {poly}(|I|)$$ f ( 1 / ε ) · poly ( | I | ) . Previously, only constant factor approximations of 5/3 and $$4/3 + \varepsilon $$ 4 / 3 + ε , respectively, were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.

Sign in / Sign up

Export Citation Format

Share Document