An approximation algorithm for the license and shift class design problem
Identifieur interne : 000997 ( Istex/Curation ); précédent : 000996; suivant : 000998An approximation algorithm for the license and shift class design problem
Auteurs : Klaus Jansen [Allemagne]Source :
- European Journal of Operational Research [ 0377-2217 ] ; 1994.
Abstract
In this paper a generalization of the license and shift class design problem is considered. Let J be a set of jobs which have to be carried out in specified time intervals, let E be a set of different engineer licenses and Z be a set of shifts. Given a price P(e, z) ϵ ∈+ for engineers with license e ϵ E assigned to shift z ϵ Z, the problem is to find numbers of engineers to carry out all jobs with minimum cost. An approximation algorithm with time complexity O(|E|·|Z|·|J|2) and approximation bound O(log|J|) is proposed for this problem.
Url:
DOI: 10.1016/0377-2217(94)90150-3
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000A56
Links to Exploration step
ISTEX:EBE7F352AA0F3F19566DC20EA93D526F5DE33F5CLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>An approximation algorithm for the license and shift class design problem</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:EBE7F352AA0F3F19566DC20EA93D526F5DE33F5C</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1016/0377-2217(94)90150-3</idno><idno type="url">https://api.istex.fr/document/EBE7F352AA0F3F19566DC20EA93D526F5DE33F5C/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000A56</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000A56</idno><idno type="wicri:Area/Istex/Curation">000997</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">An approximation algorithm for the license and shift class design problem</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, 54286 Trier</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="j">European Journal of Operational Research</title><title level="j" type="abbrev">EOR</title><idno type="ISSN">0377-2217</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1994">1994</date><biblScope unit="volume">73</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="127">127</biblScope><biblScope unit="page" to="131">131</biblScope></imprint><idno type="ISSN">0377-2217</idno></series><idno type="istex">EBE7F352AA0F3F19566DC20EA93D526F5DE33F5C</idno><idno type="DOI">10.1016/0377-2217(94)90150-3</idno><idno type="PII">0377-2217(94)90150-3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0377-2217</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper a generalization of the license and shift class design problem is considered. Let J be a set of jobs which have to be carried out in specified time intervals, let E be a set of different engineer licenses and Z be a set of shifts. Given a price P(e, z) ϵ ∈+ for engineers with license e ϵ E assigned to shift z ϵ Z, the problem is to find numbers of engineers to carry out all jobs with minimum cost. An approximation algorithm with time complexity O(|E|·|Z|·|J|2) and approximation bound O(log|J|) is proposed for this problem.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000997 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000997 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:EBE7F352AA0F3F19566DC20EA93D526F5DE33F5C
|texte= An approximation algorithm for the license and shift class design problem
}}
| This area was generated with Dilib version V0.6.31. |  |