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

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

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 19405, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Hacettepe Univ, Dept Management, Ankara, Turkey", 
      "name": "Tarim, S. Armagan"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Alcatel Lucent Bell Labs, Murray Hill, NJ 07974 USA", 
      "name": "Dogru, Mustafa K."
    }, 
    {
      "@type": "Person", 
      "affiliation": "Alcatel Lucent Bell Labs, Dublin 15, Ireland", 
      "name": "Oezen, Ulas"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Wageningen UR, Logist Decis & Informat Sci Grp, Wageningen, Netherlands", 
      "name": "Rossi, Roberto"
    }
  ], 
  "datePublished": "2011-01-01", 
  "description": "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.", 
  "headline": "An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints", 
  "identifier": 19405, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints", 
  "url": "https://aperta.ulakbim.gov.tr/record/19405"
}