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.
![[img]](https://eprints.uet.vnu.edu.vn/eprints/style/images/fileicons/other.png) |
Other (International conference)
- Published Version
Download (55kB) |
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Information Technology (IT) |
| Divisions: | Faculty of Information Technology (FIT) |
| Depositing User: | Hà Minh Hoàng |
| Date Deposited: | 10 Dec 2019 15:47 |
| Last Modified: | 12 Dec 2019 11:18 |
| URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/3674 |
Actions (login required)
 |
View Item |
