A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints

In a classical scheduling problem, we are given a set of \(n\) jobs of unit length along with precedence constraints, and the goal is to find a schedule of these jobs on \(m\) identical machines that minimizes the makespan. Using the standard 3-field notation, it is known as \(Pm|\text{prec}, p_j=1|...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-12
Hauptverfasser:	Nederlof, Jesper, Swennenhuis, Céline M F, Węgrzycki, Karol
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Lower bounds Precedence constraints Scheduling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!