Ordinal algorithms for parallel machine scheduling

Le texte intégral de ce document de travail n'est pas disponible en ligne. Une copie papier est disponible à l'Annexe de la bibliothéque. Effectuez une recherche par titre dans le catalogue pour réserver le document. // The full text of this working paper is not available online. A print copy is available in the Library Annex. Search by title in the catalogue to request the paper

Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times

AbstractThis paper considers ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times. Two objects of minimizing the latest job completion time and minimizing the latest machine completion time are studied. For the first objective, we present the optimal algorithms for m = 2, 3, 4 machine cases. For m ≥ 5, we propose an algorithm with competitive ratio 2 - 1/(m - 1) while the lower bound is 53. For the second objective, the optimal algorithm is also given. Furthermore, for a special case, an algorithm with significantly improved competitive ratio is given