Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/12003
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mohamed, Bendraouche | - |
dc.contributor.author | Mourad, Boudhar | - |
dc.date.accessioned | 2016-11-06T10:43:35Z | - |
dc.date.available | 2016-11-06T10:43:35Z | - |
dc.date.issued | 2016-11-06 | - |
dc.identifier.uri | http://dspace.univ-ouargla.dz/jspui/handle/123456789/12003 | - |
dc.description.abstract | Abstract. The problem studied in this paper consists in finding the minimum makespan in a problem of scheduling jobs on identical parallel processors subject to compatibility constraints that some jobs cannot be scheduled simultaneously in any time interval. These constraints are modeled by a graph in which compatible jobs are represented by adjacent vertices. We study the complexity of this problem for bipartite graphs and their complements. We propose polynomial heuristics which are experimentally evaluated and compared. | en_US |
dc.description.sponsorship | univ ouargla | en_US |
dc.language.iso | fr | en_US |
dc.relation.ispartofseries | 2015; | - |
dc.subject | scheduling | en_US |
dc.subject | compatibility graph | en_US |
dc.subject | complexity | en_US |
dc.subject | heuristics | en_US |
dc.title | Scheduling problem subject to compatibility constraints | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Scheduling problem subject.pdf | 719,16 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.