Výsledky vyhledávání - "Scheduling . Non-availability constraint . Approximation"

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval Autor Kacem, Imed

“…In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the…”
Získat plný text