On the complexity of scheduling incompatible jobs with unit-times
Identifieur interne : 001067 ( Istex/Corpus ); précédent : 001066; suivant : 001068On the complexity of scheduling incompatible jobs with unit-times
Auteurs : Hans L. Bodlaender ; Klaus JansenSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.
Url:
DOI: 10.1007/3-540-57182-5_21
Links to Exploration step
ISTEX:89E872BB36C12FA78C9C5457FE3FE28909BF5CC8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the complexity of scheduling incompatible jobs with unit-times</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name><affiliation><mods:affiliation>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands</mods:affiliation></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier, Germany</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-57182-5_21</idno><idno type="url">https://api.istex.fr/document/89E872BB36C12FA78C9C5457FE3FE28909BF5CC8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001067</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001067</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the complexity of scheduling incompatible jobs with unit-times</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name><affiliation><mods:affiliation>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands</mods:affiliation></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation><mods:affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier, Germany</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1993</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</idno><idno type="DOI">10.1007/3-540-57182-5_21</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Hans L. Bodlaender</name><affiliations><json:string>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands</json:string></affiliations></json:item><json:item><name>Klaus Jansen</name><affiliations><json:string>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier, Germany</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><abstract>Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.</abstract><qualityIndicators><score>5.864</score><pdfVersion>1.3</pdfVersion><pdfPageSize>439.28 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>448</abstractCharCount><pdfWordCount>5908</pdfWordCount><pdfCharCount>22909</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>72</abstractWordCount></qualityIndicators><title>On the complexity of scheduling incompatible jobs with unit-times</title><chapterId><json:string>21</json:string><json:string>Chap21</json:string></chapterId><refBibs><json:item><author><json:item><name>D,G Corneil</name></json:item><json:item><name>Y Perl</name></json:item><json:item><name>L,K Stewart</name></json:item></author><host><volume>4</volume><pages><last>934</last><first>926</first></pages><author></author><title>SIAM Journal of Computing</title><publicationDate>1985</publicationDate></host><title>A linear recognition algorithm for cographs</title><publicationDate>1985</publicationDate></json:item><json:item><host><author><json:item><name>M,R Garey</name></json:item><json:item><name>D,S Johnson</name></json:item></author><title>Computers and Intractability: A Guide to the Theory of NP-Completeness</title><publicationDate>1979</publicationDate></host></json:item><json:item><host><author><json:item><name>M,C Golumbic</name></json:item></author><title>Algorithmic graph theory and perfect graphs</title><publicationDate>1980</publicationDate></host></json:item><json:item><author><json:item><name>U,I Gupta</name></json:item><json:item><name>D,T Lee</name></json:item><json:item><name>J,Y T Leung</name></json:item></author><host><volume>12</volume><pages><last>467</last><first>459</first></pages><author></author><title>Networks</title><publicationDate>1982</publicationDate></host><title>Efficient algorithms for interval graphs and circular arc graphs</title><publicationDate>1982</publicationDate></json:item><json:item><author><json:item><name>R,M Karp</name></json:item></author><host><pages><last>104</last><first>85</first></pages><author></author><title>Complexity of computer computations</title><publicationDate>1972</publicationDate></host><title>Reducibility among combinatorial problems</title><publicationDate>1972</publicationDate></json:item><json:item><author><json:item><name>Z Lonc</name></json:item></author><host><pages><last>104</last><first>97</first></pages><author></author><title>WG Conference</title><publicationDate>1991</publicationDate></host><title>On complexity of some chain and antichain partition problems</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name>C,H Papadimitriou</name></json:item><json:item><name>M Yannakakis</name></json:item></author><host><volume>8</volume><pages><last>409</last><first>405</first></pages><author></author><title>SIAM Journal of Computing</title><publicationDate>1979</publicationDate></host><title>Scheduling interval-ordered tasks</title><publicationDate>1979</publicationDate></json:item><json:item><author><json:item><name>D Seinsche</name></json:item></author><host><volume>16</volume><pages><last>193</last><first>191</first></pages><author></author><title>Journal of Combinatoral Theory B</title><publicationDate>1974</publicationDate></host><title>On a property of the class of n-colorable graphs</title><publicationDate>1974</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>1993</copyrightDate></serie><host><editor><json:item><name>Andrzej M. Borzyszkowski</name></json:item><json:item><name>Stefan Sokołowski</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Combinatorics</value></json:item><json:item><value>Data Structures</value></json:item></subject><isbn><json:string>978-3-540-57182-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Mathematical Foundations of Computer Science 1993</title><bookId><json:string>3540571825</json:string></bookId><volume>711</volume><pages><last>300</last><first>291</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-47927-7</json:string></eisbn><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-57182-5</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-57182-5_21</json:string></doi><id>89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</id><score>0.47465461</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/89E872BB36C12FA78C9C5457FE3FE28909BF5CC8/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/89E872BB36C12FA78C9C5457FE3FE28909BF5CC8/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/89E872BB36C12FA78C9C5457FE3FE28909BF5CC8/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">On the complexity of scheduling incompatible jobs with unit-times</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag, 1993</p></availability><date>1993</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">On the complexity of scheduling incompatible jobs with unit-times</title><author xml:id="author-1"><persName><forename type="first">Hans</forename><surname>Bodlaender</surname></persName><affiliation>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands</affiliation></author><author xml:id="author-2"><persName><forename type="first">Klaus</forename><surname>Jansen</surname></persName><affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Mathematical Foundations of Computer Science 1993</title><title level="m" type="sub">18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings</title><idno type="pISBN">978-3-540-57182-7</idno><idno type="eISBN">978-3-540-47927-7</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/3-540-57182-5</idno><idno type="book-ID">3540571825</idno><idno type="book-title-ID">33794</idno><idno type="book-volume-number">711</idno><idno type="book-chapter-count">68</idno><editor><persName><forename type="first">Andrzej</forename><forename type="first">M.</forename><surname>Borzyszkowski</surname></persName></editor><editor><persName><forename type="first">Stefan</forename><surname>Sokołowski</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-05-30"></date><biblScope unit="volume">711</biblScope><biblScope unit="page" from="291">291</biblScope><biblScope unit="page" to="300">300</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><biblScope><date>1993</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</idno><idno type="DOI">10.1007/3-540-57182-5_21</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1993</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16013</label><label>I16021</label><label>I1603X</label><label>I16048</label><label>M17009</label><label>I15017</label><item><term>Computer Science</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Combinatorics</term></item><item><term>Data Structures</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-05-30">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/89E872BB36C12FA78C9C5457FE3FE28909BF5CC8/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540571825</BookID><BookTitle>Mathematical Foundations of Computer Science 1993</BookTitle><BookSubTitle>18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings</BookSubTitle><BookVolumeNumber>711</BookVolumeNumber><BookDOI>10.1007/3-540-57182-5</BookDOI><BookTitleID>33794</BookTitleID><BookPrintISBN>978-3-540-57182-7</BookPrintISBN><BookElectronicISBN>978-3-540-47927-7</BookElectronicISBN><BookChapterCount>68</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I16021" Priority="2" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="4" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="M17009" Priority="5" Type="Secondary">Combinatorics</BookSubject><BookSubject Code="I15017" Priority="6" Type="Secondary">Data Structures</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Andrzej</GivenName><GivenName>M.</GivenName><FamilyName>Borzyszkowski</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Stefan</GivenName><FamilyName>Sokołowski</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap21" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>21</ChapterID><ChapterDOI>10.1007/3-540-57182-5_21</ChapterDOI><ChapterSequenceNumber>21</ChapterSequenceNumber><ChapterTitle Language="En">On the complexity of scheduling incompatible jobs with unit-times</ChapterTitle><ChapterFirstPage>291</ChapterFirstPage><ChapterLastPage>300</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>5</Month><Day>30</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540571825</BookID><BookTitle>Mathematical Foundations of Computer Science 1993</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Hans</GivenName><GivenName>L.</GivenName><FamilyName>Bodlaender</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Klaus</GivenName><FamilyName>Jansen</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>Utrecht University</OrgName><OrgAddress><Postbox>P.O.Box 80.089</Postbox><Postcode>3508</Postcode><City>TB Utrecht</City><Country>The Netherlands</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Fachbereich IV, Mathematik und Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postbox>Postfach 3825</Postbox><Postcode>W-5500</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>On the complexity of scheduling incompatible jobs with unit-times</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>On the complexity of scheduling incompatible jobs with unit-times</title></titleInfo><name type="personal"><namePart type="given">Hans</namePart><namePart type="given">L.</namePart><namePart type="family">Bodlaender</namePart><affiliation>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht, The Netherlands</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Klaus</namePart><namePart type="family">Jansen</namePart><affiliation>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005-05-30</dateIssued><copyrightDate encoding="w3cdtf">1993</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.</abstract><relatedItem type="host"><titleInfo><title>Mathematical Foundations of Computer Science 1993</title><subTitle>18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Andrzej</namePart><namePart type="given">M.</namePart><namePart type="family">Borzyszkowski</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Stefan</namePart><namePart type="family">Sokołowski</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">1993</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic></subject><identifier type="DOI">10.1007/3-540-57182-5</identifier><identifier type="ISBN">978-3-540-57182-7</identifier><identifier type="eISBN">978-3-540-47927-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">33794</identifier><identifier type="BookID">3540571825</identifier><identifier type="BookChapterCount">68</identifier><identifier type="BookVolumeNumber">711</identifier><part><date>1993</date><detail type="volume"><number>711</number><caption>vol.</caption></detail><extent unit="pages"><start>291</start><end>300</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1993</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></relatedItem><identifier type="istex">89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</identifier><identifier type="DOI">10.1007/3-540-57182-5_21</identifier><identifier type="ChapterID">21</identifier><identifier type="ChapterID">Chap21</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1993</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1993</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001067 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001067 | 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= Corpus
|type= RBID
|clé= ISTEX:89E872BB36C12FA78C9C5457FE3FE28909BF5CC8
|texte= On the complexity of scheduling incompatible jobs with unit-times
}}
| This area was generated with Dilib version V0.6.31. |  |