A tight linear time $$\frac{13}{12}$$ 13 12 -approximation algorithm for the $$P2 || C_{\max }$$ P 2 | | C max problem

Abstract

We consider problem $$P2 || C_{\max }$$ where the goal is to schedule n jobs on two identical parallel machines to minimize the makespan. We focus on constant factor approximation algorithms with complexity independent from the required accuracy. We exploit the famous Longest Processing Time (LPT) rule that requires to sort jobs in non-ascending order of processing times and then to assign one job at a time to the machine whose load is smallest so far. We propose an approximation algorithm that applies LPT to a subset of 2k jobs, then considers a single step of local search on the obtained subschedule and finally applies list scheduling to the remaining jobs. This algorithm, when applied for $$k=5$$ , reaches a tight $$\frac{13}{12}$$ -approximation ratio improving the ratio of $$\frac{12}{11}$$ proposed by He et al. (Nav Res Logist 47:593–601, 2000). We use Mathematical Programming to analyze the approximation ratio of our approach. As a byproduct, we also show how to improve the FPTAS of Sahni for any $$n > 1/\epsilon $$ so as to reach an approximation ratio $$(1 + \epsilon )$$ with time complexity $$O(n + \frac{1}{\epsilon ^3})$$ .