eprintid: 3674
rev_number: 9
eprint_status: archive
userid: 365
dir: disk0/00/00/36/74
datestamp: 2019-12-10 15:47:06
lastmod: 2019-12-12 11:18:02
status_changed: 2019-12-10 15:47:06
type: conference_item
metadata_visibility: show
creators_name: Ha, Minh Hoang
creators_name: Vu, Duy Manh
creators_name: Zinder, Yakov
creators_name: Nguyen, Trung Thanh
creators_id: minhhoang.ha@vnu.edu.vn
title: On The Capacitated Scheduling Problem with Conflict Jobs
ispublished: pub
subjects: IT
divisions: fac_fit
abstract: 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.
date: 2019
date_type: published
full_text_status: public
pres_type: paper
event_title: KSE 2019
event_location: Da Nang
event_type: conference
refereed: TRUE
citation:   Ha, Minh Hoang and Vu, Duy Manh and Zinder, Yakov and Nguyen, Trung Thanh  (2019) On The Capacitated Scheduling Problem with Conflict Jobs.  In: KSE 2019, Da Nang.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3674/1/8919323