Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/2828
Title: | Scheduling problem subject to compatibility constraints |
Authors: | Mohamed Bendraouche and Mourad Boudhar |
Keywords: | scheduling compatibility graph complexity heuristics |
Issue Date: | 19-Dec-2013 |
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 |
Description: | 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010 |
URI: | http://hdl.handle.net/123456789/2828 |
ISSN: | kh |
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.