UET-scheduling with chain-type precedence constraints
Identifieur interne : 002E97 ( Main/Merge ); précédent : 002E96; suivant : 002E98UET-scheduling with chain-type precedence constraints
Auteurs : K. Jansen [Allemagne] ; G. J. Woeginger ; ZHONGLIANG YUSource :
- Computers & operations research [ 0305-0548 ] ; 1995.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
We consider a special case of the precedence constrained scheduling problem of unit execution time jobs on two parallel machines without preemption: the precedence constraints are chain-type and each job can be processed on only one of the two machines. We show that this problem is NP-complete in general, and we derive an approximation algorithm with constant worst case guarantee.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 001501
- to stream PascalFrancis, to step Curation: 001516
- to stream PascalFrancis, to step Checkpoint: 001272
Links to Exploration step
Pascal:95-0527905Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">UET-scheduling with chain-type precedence constraints</title><author><name sortKey="Jansen, K" sort="Jansen, K" uniqKey="Jansen K" first="K." last="Jansen">K. Jansen</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Univ. Trier, Fachbereich IV Mathematik Informatik</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Fachbereich IV Mathematik Informatik</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author><author><name sortKey="Woeginger, G J" sort="Woeginger, G J" uniqKey="Woeginger G" first="G. J." last="Woeginger">G. J. Woeginger</name></author><author><name sortKey="Zhongliang Yu" sort="Zhongliang Yu" uniqKey="Zhongliang Yu" last="Zhongliang Yu">ZHONGLIANG YU</name></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">95-0527905</idno><date when="1995">1995</date><idno type="stanalyst">PASCAL 95-0527905 INIST</idno><idno type="RBID">Pascal:95-0527905</idno><idno type="wicri:Area/PascalFrancis/Corpus">001501</idno><idno type="wicri:Area/PascalFrancis/Curation">001516</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001272</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001272</idno><idno type="wicri:doubleKey">0305-0548:1995:Jansen K:uet:scheduling:with</idno><idno type="wicri:Area/Main/Merge">002E97</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">UET-scheduling with chain-type precedence constraints</title><author><name sortKey="Jansen, K" sort="Jansen, K" uniqKey="Jansen K" first="K." last="Jansen">K. Jansen</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Univ. Trier, Fachbereich IV Mathematik Informatik</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Fachbereich IV Mathematik Informatik</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author><author><name sortKey="Woeginger, G J" sort="Woeginger, G J" uniqKey="Woeginger G" first="G. J." last="Woeginger">G. J. Woeginger</name></author><author><name sortKey="Zhongliang Yu" sort="Zhongliang Yu" uniqKey="Zhongliang Yu" last="Zhongliang Yu">ZHONGLIANG YU</name></author></analytic><series><title level="j" type="main">Computers & operations research</title><title level="j" type="abbreviated">Comput. oper. res.</title><idno type="ISSN">0305-0548</idno><imprint><date when="1995">1995</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computers & operations research</title><title level="j" type="abbreviated">Comput. oper. res.</title><idno type="ISSN">0305-0548</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Approximation</term><term>Lower bound</term><term>NP complete problem</term><term>Optimization</term><term>Parallel system</term><term>Scheduling</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Ordonnancement</term><term>Système parallèle</term><term>Problème NP complet</term><term>Algorithme</term><term>Approximation</term><term>Borne inférieure</term><term>Optimisation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We consider a special case of the precedence constrained scheduling problem of unit execution time jobs on two parallel machines without preemption: the precedence constraints are chain-type and each job can be processed on only one of the two machines. We show that this problem is NP-complete in general, and we derive an approximation algorithm with constant worst case guarantee.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><noCountry><name sortKey="Woeginger, G J" sort="Woeginger, G J" uniqKey="Woeginger G" first="G. J." last="Woeginger">G. J. Woeginger</name><name sortKey="Zhongliang Yu" sort="Zhongliang Yu" uniqKey="Zhongliang Yu" last="Zhongliang Yu">ZHONGLIANG YU</name></noCountry><country name="Allemagne"><noRegion><name sortKey="Jansen, K" sort="Jansen, K" uniqKey="Jansen K" first="K." last="Jansen">K. Jansen</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E97 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002E97 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Merge
|type= RBID
|clé= Pascal:95-0527905
|texte= UET-scheduling with chain-type precedence constraints
}}
| This area was generated with Dilib version V0.6.31. |  |