The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan
Identifieur interne : 000290 ( Hal/Corpus ); précédent : 000289; suivant : 000291The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan
Auteurs : Alix Munier-Kordon ; Djamal RebaineSource :
- European Journal of Operational Research [ 0377-2217 ] ; 2010-05.
Abstract
This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.
Url:
Links to Exploration step
Hal:hal-01195929Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan</title>
<author><name sortKey="Munier Kordon, Alix" sort="Munier Kordon, Alix" uniqKey="Munier Kordon A" first="Alix" last="Munier-Kordon">Alix Munier-Kordon</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-398846" status="VALID"><orgName>Architecture et Logiciels pour Systèmes Embarqués sur Puce</orgName>
<orgName type="acronym">ALSOC</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
<listRelation><relation active="#struct-233" type="direct"></relation>
<relation name="UMR7606" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-93591" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-233" type="direct"><org type="laboratory" xml:id="struct-233" status="VALID"><idno type="RNSR">199712651U</idno>
<orgName>Laboratoire d'Informatique de Paris 6</orgName>
<orgName type="acronym">LIP6</orgName>
<desc><address><addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lip6.fr/</ref>
</desc>
<listRelation><relation name="UMR7606" active="#struct-441569" type="direct"></relation>
<relation active="#struct-93591" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7606" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-93591" type="indirect"><org type="institution" xml:id="struct-93591" status="INCOMING"><orgName>Université Pierre et Marie Curie - Paris 6</orgName>
<orgName type="acronym">UPMC</orgName>
<desc><address><addrLine>4 place Jussieu - 75005 Paris</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.upmc.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Rebaine, Djamal" sort="Rebaine, Djamal" uniqKey="Rebaine D" first="Djamal" last="Rebaine">Djamal Rebaine</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01195929</idno>
<idno type="halId">hal-01195929</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01195929</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-01195929</idno>
<date when="2010-05">2010-05</date>
<idno type="wicri:Area/Hal/Corpus">000290</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan</title>
<author><name sortKey="Munier Kordon, Alix" sort="Munier Kordon, Alix" uniqKey="Munier Kordon A" first="Alix" last="Munier-Kordon">Alix Munier-Kordon</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-398846" status="VALID"><orgName>Architecture et Logiciels pour Systèmes Embarqués sur Puce</orgName>
<orgName type="acronym">ALSOC</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
<listRelation><relation active="#struct-233" type="direct"></relation>
<relation name="UMR7606" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-93591" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-233" type="direct"><org type="laboratory" xml:id="struct-233" status="VALID"><idno type="RNSR">199712651U</idno>
<orgName>Laboratoire d'Informatique de Paris 6</orgName>
<orgName type="acronym">LIP6</orgName>
<desc><address><addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.lip6.fr/</ref>
</desc>
<listRelation><relation name="UMR7606" active="#struct-441569" type="direct"></relation>
<relation active="#struct-93591" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7606" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-93591" type="indirect"><org type="institution" xml:id="struct-93591" status="INCOMING"><orgName>Université Pierre et Marie Curie - Paris 6</orgName>
<orgName type="acronym">UPMC</orgName>
<desc><address><addrLine>4 place Jussieu - 75005 Paris</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.upmc.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Rebaine, Djamal" sort="Rebaine, Djamal" uniqKey="Rebaine D" first="Djamal" last="Rebaine">Djamal Rebaine</name>
</author>
</analytic>
<series><title level="j">European Journal of Operational Research</title>
<idno type="ISSN">0377-2217</idno>
<imprint><date type="datePub">2010-05</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan</title>
<author role="aut"><persName><forename type="first">Alix</forename>
<surname>Munier-Kordon</surname>
</persName>
<email>alix.munier@lip6.fr</email>
<idno type="halauthor">393198</idno>
<affiliation ref="#struct-398846"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Djamal</forename>
<surname>Rebaine</surname>
</persName>
<email></email>
<idno type="halauthor">959293</idno>
</author>
<editor role="depositor"><persName><forename>Lip6</forename>
<surname>Publications</surname>
</persName>
<email>publications@lip6.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2015-09-08 16:48:53</date>
<date type="whenModified">2015-09-09 01:03:14</date>
<date type="whenReleased">2015-09-08 16:48:53</date>
<date type="whenProduced">2010-05</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="196566"><persName><forename>Lip6</forename>
<surname>Publications</surname>
</persName>
<email>publications@lip6.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01195929</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01195929</idno>
<idno type="halBibtex">munierkordon:hal-01195929</idno>
<idno type="halRefHtml">European Journal of Operational Research, Elsevier, 2010, 203 (1), pp.42-49. <10.1016/j.ejor.2009.07.030></idno>
<idno type="halRef">European Journal of Operational Research, Elsevier, 2010, 203 (1), pp.42-49. <10.1016/j.ejor.2009.07.030></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="UPMC">Université Pierre et Marie Curie</idno>
<idno type="stamp" n="LIP6" p="UPMC">Laboratoire d'Informatique de Paris 6</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan</title>
<author role="aut"><persName><forename type="first">Alix</forename>
<surname>Munier-Kordon</surname>
</persName>
<email>alix.munier@lip6.fr</email>
<idno type="halAuthorId">393198</idno>
<affiliation ref="#struct-398846"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Djamal</forename>
<surname>Rebaine</surname>
</persName>
<idno type="halAuthorId">959293</idno>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">13070</idno>
<idno type="issn">0377-2217</idno>
<title level="j">European Journal of Operational Research</title>
<imprint><publisher>Elsevier</publisher>
<biblScope unit="volume">203</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="pp">42-49</biblScope>
<date type="datePub">2010-05</date>
</imprint>
</monogr>
<idno type="doi">10.1016/j.ejor.2009.07.030</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000290 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 000290 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Musique |area= OperaV1 |flux= Hal |étape= Corpus |type= RBID |clé= Hal:hal-01195929 |texte= The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan }}
This area was generated with Dilib version V0.6.21. |