On scheduling problems restricted to interval orders
Identifieur interne : 001120 ( Istex/Corpus ); précédent : 001119; suivant : 001121On scheduling problems restricted to interval orders
Auteurs : Klaus JansenSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.
Url:
DOI: 10.1007/3-540-56402-0_33
Links to Exploration step
ISTEX:47F37255EB68111B87CC2AE071D9F88C94C865FDLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On scheduling problems restricted to interval orders</title><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:47F37255EB68111B87CC2AE071D9F88C94C865FD</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-56402-0_33</idno><idno type="url">https://api.istex.fr/document/47F37255EB68111B87CC2AE071D9F88C94C865FD/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001120</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001120</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On scheduling problems restricted to interval orders</title><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">47F37255EB68111B87CC2AE071D9F88C94C865FD</idno><idno type="DOI">10.1007/3-540-56402-0_33</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</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: In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.</div></front></TEI><istex><corpusName>springer</corpusName><author><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: In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.</abstract><qualityIndicators><score>5.996</score><pdfVersion>1.3</pdfVersion><pdfPageSize>439.136 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>492</abstractCharCount><pdfWordCount>5518</pdfWordCount><pdfCharCount>21543</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>83</abstractWordCount></qualityIndicators><title>On scheduling problems restricted to interval orders</title><chapterId><json:string>4</json:string><json:string>Chap4</json:string></chapterId><refBibs><json:item><author><json:item><name>D Bernstein</name></json:item><json:item><name>M Rodeh</name></json:item><json:item><name> Gertner</name></json:item></author><host><volume>38</volume><pages><last>1313</last><first>1308</first></pages><author></author><title>IEEE Trans. on Comput</title><publicationDate>1989</publicationDate></host><title>On the complexity of scheduling problems for parallel pipelined machines</title><publicationDate>1989</publicationDate></json:item><json:item><author><json:item><name>R,S Chang</name></json:item><json:item><name>C,T Lee</name></json:item></author><host><volume>15</volume><pages><last>478</last><first>471</first></pages><author></author><title>Comput. Opns. Res</title><publicationDate>1988</publicationDate></host><title>On a scheduling problem where a job can be executed only by a limited number of processors</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>Y,L Chen</name></json:item><json:item><name>Y Chin</name></json:item></author><host><volume>16</volume><pages><last>417</last><first>409</first></pages><author></author><title>Comput. Opns. Res</title><publicationDate>1989</publicationDate></host><title>Scheduling unlt-time jobs on processors with different capabilities</title><publicationDate>1989</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>D,K Goyal</name></json:item></author><title>Scheduling processor bound systems</title><publicationDate>1976</publicationDate></host></json:item><json:item><author><json:item><name>T,C I{u</name></json:item></author><host><volume>9</volume><pages><last>848</last><first>841</first></pages><author></author><title>Opns Res</title><publicationDate>1961</publicationDate></host><title>Parallel sequencing and assembly llne problems</title><publicationDate>1961</publicationDate></json:item><json:item><host><author><json:item><name>K Jansen</name></json:item></author><title>Analyse of scheduling problems with typed task systems, (submitted)</title></host></json:item><json:item><author><json:item><name>D,S Johnson</name></json:item></author><host><volume>9</volume><pages><last>278</last><first>256</first></pages><author></author><title>J. Comput. Syst. Sci</title><publicationDate>1974</publicationDate></host><title>Approximation algorithms for combinatorial problems</title><publicationDate>1974</publicationDate></json:item><json:item><author><json:item><name>H Kellerer</name></json:item><json:item><name>G,J Woeginger</name></json:item></author><host><volume>19</volume><pages><last>8</last><first>1</first></pages><author></author><title>Comput. Opns. Res</title><publicationDate>1992</publicationDate></host><title>UET-scheduling with constrained processor allocation</title><publicationDate>1992</publicationDate></json:item><json:item><author><json:item><name>J,K Lenstra</name></json:item><json:item><name>Rirmooy Kan</name></json:item><json:item><name>A,H G </name></json:item></author><host><volume>26</volume><pages><last>35</last><first>22</first></pages><author></author><title>Opns Res</title><publicationDate>1978</publicationDate></host><title>Complexity of scheduling under precedence constraints</title><publicationDate>1978</publicationDate></json:item><json:item><author><json:item><name>C,H Papadimitriou</name></json:item><json:item><name>M Yatmakakis</name></json:item></author><host><volume>8</volume><pages><last>409</last><first>405</first></pages><author></author><title>SIAM J. Cornput</title><publicationDate>1979</publicationDate></host><title>Scheduling interval-ordered tasks</title><publicationDate>1979</publicationDate></json:item><json:item><author><json:item><name>J,D Ullman</name></json:item></author><host><volume>0</volume><pages><last>393</last><first>384</first></pages><author></author><title>J. Comput. Syst. Sci</title><publicationDate>1975</publicationDate></host><title>NP-complete scheduling problems</title><publicationDate>1975</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name></json:item><json:item><name>Juris 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>Ernst W. Mayr</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Combinatorics</value></json:item><json:item><value>Computation by Abstract Devices</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>Data Structures</value></json:item></subject><isbn><json:string>978-3-540-56402-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Graph-Theoretic Concepts in Computer Science</title><bookId><json:string>3540564020</json:string></bookId><volume>657</volume><pages><last>36</last><first>27</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-47554-5</json:string></eisbn><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-56402-0</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>1993</copyrightDate><doi><json:string>10.1007/3-540-56402-0_33</json:string></doi><id>47F37255EB68111B87CC2AE071D9F88C94C865FD</id><score>0.6257803</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/47F37255EB68111B87CC2AE071D9F88C94C865FD/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/47F37255EB68111B87CC2AE071D9F88C94C865FD/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/47F37255EB68111B87CC2AE071D9F88C94C865FD/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">On scheduling problems restricted to interval orders</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 scheduling problems restricted to interval orders</title><author xml:id="author-1"><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">Graph-Theoretic Concepts in Computer Science</title><title level="m" type="sub">18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings</title><idno type="pISBN">978-3-540-56402-7</idno><idno type="eISBN">978-3-540-47554-5</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/3-540-56402-0</idno><idno type="book-ID">3540564020</idno><idno type="book-title-ID">33741</idno><idno type="book-volume-number">657</idno><idno type="book-chapter-count">29</idno><editor><persName><forename type="first">Ernst</forename><forename type="first">W.</forename><surname>Mayr</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-06-04"></date><biblScope unit="volume">657</biblScope><biblScope unit="page" from="27">27</biblScope><biblScope unit="page" to="36">36</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName></editor><editor><persName><forename type="first">Juris</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">47F37255EB68111B87CC2AE071D9F88C94C865FD</idno><idno type="DOI">10.1007/3-540-56402-0_33</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1993</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.</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>I16021</label><label>M17009</label><label>I16013</label><label>I1603X</label><label>I16048</label><label>I15017</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Combinatorics</term></item><item><term>Computation by Abstract Devices</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Data Structures</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-06-04">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-20">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/47F37255EB68111B87CC2AE071D9F88C94C865FD/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>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540564020</BookID><BookTitle>Graph-Theoretic Concepts in Computer Science</BookTitle><BookSubTitle>18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings</BookSubTitle><BookVolumeNumber>657</BookVolumeNumber><BookDOI>10.1007/3-540-56402-0</BookDOI><BookTitleID>33741</BookTitleID><BookPrintISBN>978-3-540-56402-7</BookPrintISBN><BookElectronicISBN>978-3-540-47554-5</BookElectronicISBN><BookChapterCount>29</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="M17009" Priority="2" Type="Secondary">Combinatorics</BookSubject><BookSubject Code="I16013" Priority="3" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I1603X" Priority="4" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="5" Type="Secondary">Mathematical Logic and Formal Languages</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>Ernst</GivenName><GivenName>W.</GivenName><FamilyName>Mayr</FamilyName></EditorName></Editor></EditorGroup></BookHeader><Chapter ID="Chap4" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>4</ChapterID><ChapterDOI>10.1007/3-540-56402-0_33</ChapterDOI><ChapterSequenceNumber>4</ChapterSequenceNumber><ChapterTitle Language="En">On scheduling problems restricted to interval orders</ChapterTitle><ChapterFirstPage>27</ChapterFirstPage><ChapterLastPage>36</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1993</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>4</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>3540564020</BookID><BookTitle>Graph-Theoretic Concepts in Computer Science</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Klaus</GivenName><FamilyName>Jansen</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Fachbereich IV, Mathematik und Informatik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Street>Postfach 3825</Street><Postcode>W-5500</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>On scheduling problems restricted to interval orders</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>On scheduling problems restricted to interval orders</title></titleInfo><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-06-04</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: In this paper we analyse a scheduling problem where each processor can execute only a subset of all unit-time jobs. We show that this problem is NP-complete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with logarithmic approximation bound.</abstract><relatedItem type="host"><titleInfo><title>Graph-Theoretic Concepts in Computer Science</title><subTitle>18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Ernst</namePart><namePart type="given">W.</namePart><namePart type="family">Mayr</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="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</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="I15017">Data Structures</topic></subject><identifier type="DOI">10.1007/3-540-56402-0</identifier><identifier type="ISBN">978-3-540-56402-7</identifier><identifier type="eISBN">978-3-540-47554-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">33741</identifier><identifier type="BookID">3540564020</identifier><identifier type="BookChapterCount">29</identifier><identifier type="BookVolumeNumber">657</identifier><part><date>1993</date><detail type="volume"><number>657</number><caption>vol.</caption></detail><extent unit="pages"><start>27</start><end>36</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">Gerhard</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</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">47F37255EB68111B87CC2AE071D9F88C94C865FD</identifier><identifier type="DOI">10.1007/3-540-56402-0_33</identifier><identifier type="ChapterID">4</identifier><identifier type="ChapterID">Chap4</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 001120 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001120 | 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:47F37255EB68111B87CC2AE071D9F88C94C865FD
|texte= On scheduling problems restricted to interval orders
}}
| This area was generated with Dilib version V0.6.31. |  |