Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph

The paper considers scheduling on parallel machines under the constraint that some pairs of jobs cannot be processed concurrently. Each job has an associated weight, and all jobs have the same deadline. The objective is to maximise the total weight of on-time jobs. The problem is known to be strongl...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org
Hauptverfasser:	Zinder, Yakov, Berlińska, Joanna, Peter, Charlie
Format:	Paper
Sprache:	Englisch
Veröffentlicht:	Ithaca Cornell University Library, arXiv.org 04.03.2021
Schlagworte:	Integer programming Linear programming Polynomials Scheduling Search algorithms Weight
ISSN:	2331-8422
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!