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...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Zinder, Yakov, Berlińska, Joanna, Peter, Charlie
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 04.03.2021
Predmet:	Integer programming Linear programming Polynomials Scheduling Search algorithms Weight
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!