On the capacitated scheduling problem with conflict jobs

Ha, MH; Vu, DM; Zinder, Y; Thanh, T

On the capacitated scheduling problem with conflict jobs

Ha, MH Vu, DM Zinder, Y Thanh, T

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: Proceedings of 2019 11th International Conference on Knowledge and Systems Engineering, KSE 2019, 2019
Issue Date:: 2019-10-01

Closed Access

	Filename	Description	Size
	08919323.pdf	Published version	238.45 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Ha, MH
dc.contributor.author	Vu, DM
dc.contributor.author	Zinder, Y
dc.contributor.author	Thanh, T
dc.date	2019-10-24
dc.date.accessioned	2020-06-18T22:38:42Z
dc.date.available	2020-06-18T22:38:42Z
dc.date.issued	2019-10-01
dc.identifier.citation	Proceedings of 2019 11th International Conference on Knowledge and Systems Engineering, KSE 2019, 2019
dc.identifier.isbn	9781728130033
dc.identifier.issn	2164-2508
dc.identifier.uri	http://hdl.handle.net/10453/141545
dc.description.abstract	© 2019 IEEE. The paper is concerned with scheduling jobs on parallel identical machines under the restrictions imposed by a conflict graph. The nodes of this conflict graph represent jobs and each edge indicates that the jobs associated with the nodes, incident to this edge, can not be processed concurrently. The jobs have a common due date and each job has the associated weight. The goal is to maximise the total weight of jobs which completion times do not exceed the due date. The considered scheduling model was motivated by the problem arising in the telecommunication industry. The paper identifies polynomially solvable and NP-hard particular cases and presents two mixed integer linear programming formulations together with their comparison by means of computational experiments.
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	Proceedings of 2019 11th International Conference on Knowledge and Systems Engineering, KSE 2019
dc.relation.ispartof	International Conference on Knowledge and Systems Engineering
dc.relation.isbasedon	10.1109/KSE.2019.8919323
dc.rights	© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.title	On the capacitated scheduling problem with conflict jobs
dc.type	Conference Proceeding
utslib.location.activity	Da Nang, Vietnam
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2020-06-18T22:38:38Z
pubs.finish-date	2019-10-26
pubs.place-of-publication	Piscataway, USA
pubs.publication-status	Published
pubs.start-date	2019-10-24
dc.location	Piscataway, USA

Abstract:

© 2019 IEEE. The paper is concerned with scheduling jobs on parallel identical machines under the restrictions imposed by a conflict graph. The nodes of this conflict graph represent jobs and each edge indicates that the jobs associated with the nodes, incident to this edge, can not be processed concurrently. The jobs have a common due date and each job has the associated weight. The goal is to maximise the total weight of jobs which completion times do not exceed the due date. The considered scheduling model was motivated by the problem arising in the telecommunication industry. The paper identifies polynomially solvable and NP-hard particular cases and presents two mixed integer linear programming formulations together with their comparison by means of computational experiments.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/141545