preprints.org > computer science and mathematics > algebra and number theory > 202101.0142.v2

Working Paper Article Version 2 This version is not peer-reviewed

Version 1 : Received: 6 January 2021 / Approved: 8 January 2021 / Online: 8 January 2021 (10:59:29 CET)
Version 2 : Received: 16 March 2021 / Approved: 16 March 2021 / Online: 16 March 2021 (15:08:24 CET)

We consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

scheduling; uniform machines; release time; delivery time; time complexity; algorithm

Computer Science and Mathematics, Algebra and Number Theory

* All users must log in before leaving a comment