InforLorV4, Hal, Corpus, bibRecord, 000A10

A window time negotiation approach at the scheduling level inside supply chains

Identifieur interne : 000A10 ( Hal/Corpus ); précédent : 000A09; suivant : 000A11

A window time negotiation approach at the scheduling level inside supply chains

Auteurs : Marie-Claude Portmann ; Zerouk Mouloua

Source :

RBID : Hal:inria-00187505

English descriptors

mix :
- decomposition approach, just in time, meta-heuristics, negotiations, scheduling, supply chain, “pert cost” algorithm.

Abstract

We consider a supply chain consisting in a network of enterprises with independent decision centers. The products of the assembly enterprise are produced using components and/or sub products supplied by other enterprises or external suppliers. We are at the scheduling level and each enterprise builds its own schedules, which are dependent. Negotiations between decision centers can be expressed in term of penalty functions associated with soft and hard release and due dates. At each negotiation point, hard release and due dates are considered as imperative constraints, while soft release and due dates define soft intervals and induce earliness and tardiness penalties. Any interval can be modified during the negotiation process. A global solution is searched by an iterative decomposition approach including alternatively bilateral negotiations of the soft and hard constraints and just in time scheduling, minimizing the local total sum of penalties, built by approximation approaches. We assume that production centers are flow shop. To solve each local just-in-time scheduling problem, we propose an approximation approach based on meta-heuristics, in which a solution is described by the job order on each machine and is evaluated using a “pert cost” algorithm. A semi-decentralized control is suggested to assume the negotiation convergence.

Url:

https://hal.inria.fr/inria-00187505

Links to Exploration step

Hal:inria-00187505

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">A window time negotiation approach at the scheduling level inside supply chains</title>
<author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName>
<orgName type="acronym">ORCHIDS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref>
</desc>
<listRelation><relation active="#struct-423085" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName>
<orgName type="acronym">LORIA - NSS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Mouloua, Zerouk" sort="Mouloua, Zerouk" uniqKey="Mouloua Z" first="Zerouk" last="Mouloua">Zerouk Mouloua</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName>
<orgName type="acronym">ORCHIDS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref>
</desc>
<listRelation><relation active="#struct-423085" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName>
<orgName type="acronym">LORIA - NSS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00187505</idno>
<idno type="halId">inria-00187505</idno>
<idno type="halUri">https://hal.inria.fr/inria-00187505</idno>
<idno type="url">https://hal.inria.fr/inria-00187505</idno>
<date when="2007-08-28">2007-08-28</date>
<idno type="wicri:Area/Hal/Corpus">000A10</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A window time negotiation approach at the scheduling level inside supply chains</title>
<author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName>
<orgName type="acronym">ORCHIDS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref>
</desc>
<listRelation><relation active="#struct-423085" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName>
<orgName type="acronym">LORIA - NSS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Mouloua, Zerouk" sort="Mouloua, Zerouk" uniqKey="Mouloua Z" first="Zerouk" last="Mouloua">Zerouk Mouloua</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-44715" status="VALID"><orgName>Operations research for Complex HybrId Decision Sytems</orgName>
<orgName type="acronym">ORCHIDS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/orchids</ref>
</desc>
<listRelation><relation active="#struct-423085" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName>
<orgName type="acronym">LORIA - NSS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>decomposition approach</term>
<term>just in time</term>
<term>meta-heuristics</term>
<term>negotiations</term>
<term>scheduling</term>
<term>supply chain</term>
<term>“pert cost” algorithm</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We consider a supply chain consisting in a network of enterprises with independent decision centers. The products of the assembly enterprise are produced using components and/or sub products supplied by other enterprises or external suppliers. We are at the scheduling level and each enterprise builds its own schedules, which are dependent. Negotiations between decision centers can be expressed in term of penalty functions associated with soft and hard release and due dates. At each negotiation point, hard release and due dates are considered as imperative constraints, while soft release and due dates define soft intervals and induce earliness and tardiness penalties. Any interval can be modified during the negotiation process. A global solution is searched by an iterative decomposition approach including alternatively bilateral negotiations of the soft and hard constraints and just in time scheduling, minimizing the local total sum of penalties, built by approximation approaches. We assume that production centers are flow shop. To solve each local just-in-time scheduling problem, we propose an approximation approach based on meta-heuristics, in which a solution is described by the job order on each machine and is evaluated using a “pert cost” algorithm. A semi-decentralized control is suggested to assume the negotiation convergence.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">A window time negotiation approach at the scheduling level inside supply chains</title>
<author role="aut"><persName><forename type="first">Marie-Claude</forename>
<surname>Portmann</surname>
</persName>
<email>portmann@loria.fr</email>
<idno type="halauthor">145185</idno>
<orgName ref="#struct-364081"></orgName>
<affiliation ref="#struct-44715"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Zerouk</forename>
<surname>Mouloua</surname>
</persName>
<email>mouloua@loria.fr</email>
<idno type="halauthor">224535</idno>
<orgName ref="#struct-364081"></orgName>
<affiliation ref="#struct-44715"></affiliation>
</author>
<editor role="depositor"><persName><forename>Marie-Claude</forename>
<surname>Portmann</surname>
</persName>
<email>Marie-Claude.Portmann@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2009-11-14 07:00:04</date>
<date type="whenModified">2015-09-21 11:24:58</date>
<date type="whenReleased">2007-11-14 17:26:21</date>
<date type="whenProduced">2007-08-28</date>
<date type="whenEndEmbargoed">2009-11-14</date>
<ref type="file" target="https://hal.inria.fr/inria-00187505/document"><date notBefore="2009-11-14"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/inria-00187505/file/PortmannMouloua-Mista2007_rev.pdf"><date notBefore="2009-11-14"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="103576"><persName><forename>Marie-Claude</forename>
<surname>Portmann</surname>
</persName>
<email>Marie-Claude.Portmann@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00187505</idno>
<idno type="halUri">https://hal.inria.fr/inria-00187505</idno>
<idno type="halBibtex">portmann:inria-00187505</idno>
<idno type="halRefHtml">Philippe Baptiste and Graham Kendall and Alix Munier-Kordon and Francis Sourd. 3rd Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA 2007, Aug 2007, Paris, France. pp.410-417, 2007</idno>
<idno type="halRef">Philippe Baptiste and Graham Kendall and Alix Munier-Kordon and Francis Sourd. 3rd Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA 2007, Aug 2007, Paris, France. pp.410-417, 2007</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A window time negotiation approach at the scheduling level inside supply chains</title>
<author role="aut"><persName><forename type="first">Marie-Claude</forename>
<surname>Portmann</surname>
</persName>
<email>portmann@loria.fr</email>
<idno type="halAuthorId">145185</idno>
<orgName ref="#struct-364081"></orgName>
<affiliation ref="#struct-44715"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Zerouk</forename>
<surname>Mouloua</surname>
</persName>
<email>mouloua@loria.fr</email>
<idno type="halAuthorId">224535</idno>
<orgName ref="#struct-364081"></orgName>
<affiliation ref="#struct-44715"></affiliation>
</author>
</analytic>
<monogr><meeting><title>3rd Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA 2007</title>
<date type="start">2007-08-28</date>
<settlement>Paris</settlement>
<country key="FR">France</country>
</meeting>
<respStmt><resp>conferenceOrganizer</resp>
<name>Philippe Baptiste and Graham Kendall and Alix Munier-Kordon and Francis Sourd</name>
</respStmt>
<editor>Philippe Baptiste and Graham Kendall and Alix Munier-Kordon and Francis Sourd</editor>
<imprint><biblScope unit="pp">410-417</biblScope>
<date type="datePub">2007</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">scheduling</term>
<term xml:lang="en">supply chain</term>
<term xml:lang="en">just in time</term>
<term xml:lang="en">negotiations</term>
<term xml:lang="en">decomposition approach</term>
<term xml:lang="en">“pert cost” algorithm</term>
<term xml:lang="en">meta-heuristics</term>
</keywords>
<classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">We consider a supply chain consisting in a network of enterprises with independent decision centers. The products of the assembly enterprise are produced using components and/or sub products supplied by other enterprises or external suppliers. We are at the scheduling level and each enterprise builds its own schedules, which are dependent. Negotiations between decision centers can be expressed in term of penalty functions associated with soft and hard release and due dates. At each negotiation point, hard release and due dates are considered as imperative constraints, while soft release and due dates define soft intervals and induce earliness and tardiness penalties. Any interval can be modified during the negotiation process. A global solution is searched by an iterative decomposition approach including alternatively bilateral negotiations of the soft and hard constraints and just in time scheduling, minimizing the local total sum of penalties, built by approximation approaches. We assume that production centers are flow shop. To solve each local just-in-time scheduling problem, we propose an approximation approach based on meta-heuristics, in which a solution is described by the job order on each machine and is evaluated using a “pert cost” algorithm. A semi-decentralized control is suggested to assume the negotiation convergence.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A10 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 000A10 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:inria-00187505
   |texte=   A window time negotiation approach at the scheduling level inside supply chains
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

A window time negotiation approach at the scheduling level inside supply chains

A window time negotiation approach at the scheduling level inside supply chains

Source :

English descriptors

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri