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

Full description

Saved in:

Bibliographic Details
Published in:	arXiv.org
Main Authors:	Zinder, Yakov, Berlińska, Joanna, Peter, Charlie
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 04.03.2021
Subjects:	Integer programming Linear programming Polynomials Scheduling Search algorithms Weight
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!