Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/2828
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mohamed Bendraouche and Mourad Boudhar | - |
dc.date.accessioned | 2013-12-19T15:02:36Z | - |
dc.date.available | 2013-12-19T15:02:36Z | - |
dc.date.issued | 2013-12-19 | - |
dc.identifier.issn | kh | - |
dc.identifier.uri | http://hdl.handle.net/123456789/2828 | - |
dc.description | 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010 | en_US |
dc.description.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 ex- perimentally evaluated and compared | en_US |
dc.language.iso | en | en_US |
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 | |
---|---|---|---|---|
Mohamed Bendraouche.pdf | 719,03 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.