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

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

JSON

{
  "conceptrecid": "19404", 
  "created": "2021-03-15T10:21:15.586804+00:00", 
  "doi": "10.1016/j.ejor.2011.06.034", 
  "files": [
    {
      "bucket": "4e0cd215-c15c-40b9-b7d6-2e818f8d27cb", 
      "checksum": "md5:b90235c1a227779717d97279ee873c0c", 
      "key": "bib-245bfae8-91c4-4d2c-9464-f96646d52244.txt", 
      "links": {
        "self": "https://aperta.ulakbim.gov.tr/api/files/4e0cd215-c15c-40b9-b7d6-2e818f8d27cb/bib-245bfae8-91c4-4d2c-9464-f96646d52244.txt"
      }, 
      "size": 221, 
      "type": "txt"
    }
  ], 
  "id": 19405, 
  "links": {
    "badge": "https://aperta.ulakbim.gov.tr/badge/doi/10.1016/j.ejor.2011.06.034.svg", 
    "bucket": "https://aperta.ulakbim.gov.tr/api/files/4e0cd215-c15c-40b9-b7d6-2e818f8d27cb", 
    "doi": "https://doi.org/10.1016/j.ejor.2011.06.034", 
    "html": "https://aperta.ulakbim.gov.tr/record/19405", 
    "latest": "https://aperta.ulakbim.gov.tr/api/records/19405", 
    "latest_html": "https://aperta.ulakbim.gov.tr/record/19405"
  }, 
  "metadata": {
    "access_right": "open", 
    "access_right_category": "success", 
    "communities": [
      {
        "id": "tubitak-destekli-proje-yayinlari"
      }
    ], 
    "creators": [
      {
        "affiliation": "Hacettepe Univ, Dept Management, Ankara, Turkey", 
        "name": "Tarim, S. Armagan"
      }, 
      {
        "affiliation": "Alcatel Lucent Bell Labs, Murray Hill, NJ 07974 USA", 
        "name": "Dogru, Mustafa K."
      }, 
      {
        "affiliation": "Alcatel Lucent Bell Labs, Dublin 15, Ireland", 
        "name": "Oezen, Ulas"
      }, 
      {
        "affiliation": "Wageningen UR, Logist Decis & Informat Sci Grp, Wageningen, Netherlands", 
        "name": "Rossi, Roberto"
      }
    ], 
    "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.", 
    "doi": "10.1016/j.ejor.2011.06.034", 
    "has_grant": false, 
    "journal": {
      "issue": "3", 
      "pages": "563-571", 
      "title": "EUROPEAN JOURNAL OF OPERATIONAL RESEARCH", 
      "volume": "215"
    }, 
    "license": {
      "id": "cc-by"
    }, 
    "publication_date": "2011-01-01", 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "19405"
          }, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "19404"
          }
        }
      ]
    }, 
    "resource_type": {
      "subtype": "article", 
      "title": "Dergi makalesi", 
      "type": "publication"
    }, 
    "title": "An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints"
  }, 
  "owners": [
    1
  ], 
  "revision": 1, 
  "stats": {
    "downloads": 6.0, 
    "unique_downloads": 6.0, 
    "unique_views": 42.0, 
    "version_downloads": 6.0, 
    "version_unique_downloads": 6.0, 
    "version_unique_views": 25.0, 
    "version_views": 25.0, 
    "version_volume": 1326.0, 
    "views": 42.0, 
    "volume": 1326.0
  }, 
  "updated": "2021-03-15T10:21:15.628748+00:00"
}