DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/12003| Title: | Scheduling problem subject to compatibility constraints |
| Authors: | Mohamed, Bendraouche Mourad, Boudhar |
| Keywords: | scheduling compatibility graph complexity heuristics |
| Issue Date: | 6-Nov-2016 |
| Series/Report no.: | 2015; |
| 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. |
| URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/12003 |
| 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.