• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Stochastic lot sizing problem with controllable processing times

      Thumbnail
      View / Download
      354.8 Kb
      Author
      Koca, E.
      Yaman, H.
      Aktürk, M. S.
      Date
      2015
      Source Title
      Omega
      Print ISSN
      0305-0483
      Electronic ISSN
      1873-5274
      Publisher
      Elsevier
      Volume
      53
      Pages
      1 - 10
      Language
      English
      Type
      Article
      Item Usage Stats
      132
      views
      139
      downloads
      Abstract
      In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost function is a convex function as it may reflect increasing marginal costs of larger reductions and may be more appropriate when the resource life, energy consumption or carbon emission are taken into consideration. We consider this problem under static uncertainty strategy and α service level constraints. We first introduce a nonlinear mixed integer programming formulation of the problem, and use the recent advances in second order cone programming to strengthen it and then solve by a commercial solver. Our computational experiments show that taking the processing times as constant may lead to more costly production plans, and the value of controllable processing times becomes more evident for a stochastic environment with a limited capacity. Moreover, we observe that controllable processing times increase the solution flexibility and provide a better solution in most of the problem instances, although the largest improvements are obtained when setup costs are high and the system has medium sized capacities.
      Keywords
      Controllable processing times
      Second order cone programming
      Stochastic lot sizing
      Permalink
      http://hdl.handle.net/11693/21848
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.omega.2014.11.003
      Collections
      • Department of Industrial Engineering 685
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy