Stochastic lot sizing problem with controllable processing times

doi:10.1016/j.omega.2014.11.003

Return

Stochastic lot sizing problem with controllable processing times

2015-06-01

PRE

Esra Koca

Hande Yaman

M. Seli̇m Aktürk *

DOI：10.1016/j.omega.2014.11.003

Original

Original request for help

Save

Abstract

En 中文

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 a 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. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Stochastic lot sizing

Controllable processing times

Second order cone programming

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.