1 Ocak 2011 Dergi makalesi Açık Erişim

Tarim, S. Armagan; Dogru, Mustafa K.; Oezen, Ulas; Rossi, Roberto

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/19405</identifier>
  <creators>
    <creator>
      <creatorName>Tarim, S. Armagan</creatorName>
      <givenName>S. Armagan</givenName>
      <familyName>Tarim</familyName>
      <affiliation>Hacettepe Univ, Dept Management, Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Dogru, Mustafa K.</creatorName>
      <givenName>Mustafa K.</givenName>
      <familyName>Dogru</familyName>
      <affiliation>Alcatel Lucent Bell Labs, Murray Hill, NJ 07974 USA</affiliation>
    </creator>
    <creator>
      <creatorName>Oezen, Ulas</creatorName>
      <givenName>Ulas</givenName>
      <familyName>Oezen</familyName>
      <affiliation>Alcatel Lucent Bell Labs, Dublin 15, Ireland</affiliation>
    </creator>
    <creator>
      <creatorName>Rossi, Roberto</creatorName>
      <givenName>Roberto</givenName>
      <familyName>Rossi</familyName>
      <affiliation>Wageningen UR, Logist Decis &amp; Informat Sci Grp, Wageningen, Netherlands</affiliation>
    </creator>
  </creators>
  <titles>
    <title>An Efficient Computational Method For A Stochastic Dynamic Lot-Sizing Problem Under Service-Level Constraints</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2011</publicationYear>
  <dates>
    <date dateType="Issued">2011-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/19405</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.ejor.2011.06.034</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time. (C) 2011 Elsevier B.V. All rights reserved.</description>
  </descriptions>
</resource>