Show simple item record

dc.contributor.authorLucarelli, Giorgio
HAL ID: 5944
ORCID: 0000-0001-7368-355X
dc.contributor.authorMilis, Ioannis
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2011-03-22T15:24:15Z
dc.date.available2011-03-22T15:24:15Z
dc.date.issued2007
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5800
dc.language.isoenen
dc.subjectBatch Schedulingen
dc.subjectAlgorithmicsen
dc.subject.ddc003en
dc.titleOn a generalized graph coloring/batch scheduling problemen
dc.typeCommunication / Conférence
dc.description.abstractenWe study a batch scheduling problem where jobs are no more independent but they are subject to (in)compatibility constraints described by an underlying graph. The problem is equiva- lent to a generalized weighted graph coloring problem. We study the frontier between polynomial and NP-variants of the problem as well as the approximability of NP-hard variants.en
dc.identifier.citationpages8en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.conftitleMultidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2007)en
dc.relation.confdate2007-08
dc.relation.confcityParisen
dc.relation.confcountryFranceen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record