On the capacitated scheduling problem with conflict jobs
- Publication Type:
- Conference Proceeding
- Proceedings of 2019 11th International Conference on Knowledge and Systems Engineering, KSE 2019, 2019
- Issue Date:
|08919323.pdf||Published version||238.45 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 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: