Stochastic lot sizing problem with controllable processing times

Omega (United Kingdom)

Volumn 53, Issue , 2015, Pages 1-10

  Koca, Esra ^a   Yaman, Hande ^a   Aktürk, Selim ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Controllable processing times; Second order cone programming; Stochastic lot sizing

Indexed keywords

COST FUNCTIONS; COST REDUCTION; ENERGY UTILIZATION; INTEGER PROGRAMMING; PRODUCTION CONTROL; STOCHASTIC SYSTEMS;

CAPACITATED LOT SIZING PROBLEM; CONTROLLABLE PROCESSING TIME; CONVEX FUNCTIONS; COST-FUNCTION; LOT SIZING PROBLEMS; MARGINAL COSTS; PROCESSING TIME; SECOND-ORDER CONE PROGRAMMING; STOCHASTIC LOT-SIZING; STOCHASTICS;

SECOND-ORDER CONE PROGRAMMING;

EID: 84920121519     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2014.11.003     Document Type: Article

References (41)

1. Ahmed S., King A.J., Parija G. A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. Journal of Global Optimization 2003, 26:3-24.
2. Aktürk M.S., Atamtürk A., Gürel S. A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Operations Research Letters 2009, 37(3):187-191.
3. Atamtürk A., Hochbaum D.S. Capacity acquisition, subcontracting, and lot sizing. Management Science 2001, 47(8):1081-1100.
4. Ben-Tal A, Nemirovski A. Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Society for Industrial and Applied Mathematics, Philadelphia, PA; 2001.
5. Bookbinder J.H., Tan J.-Y. Strategies for probabilistic lot-sizing problem with service-level constraints. Management Science 1988, 34(9):1096-1108.
6. Chen F.Y., Krass D. Inventory models with minimal service level constraints. European Journal of Operational Research 2001, 134(1):120-140.
7. L Croxton K., Gendron B., Magnanti T.L. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science 2003, 49(9):1268-1273.
8. Florian M., Lenstra J.K., Rinnooy Kan A.H.G. Deterministic production planning. algorithms and complexity. Management Science 1980, 26(7):669-679.
9. Gürel S., Körpeoğlu E., Aktürk M.S. An anticipative scheduling approach with controllable processing times. Computers & Operations Research 2010, 37(6):1002-1013.
10. Helber S., Sahling F., Schimmelpfeng K. Dynamic capacitated lot sizing with random demand and dynamic safety stocks. OR Spectrum 2013, 35:75-105.
11. Jansen K., Mastrolilli M. Approximation schemes for parallel machine scheduling problems with controllable processing times. Computers & Operations Research 2004, 31(10):1565-1581.
12. Jeang A. Simultaneous determination of production lot size and process parameters under process deterioration and process breakdown. Omega 2012, 40:774-781.
13. Karimi B., Fatemi Ghomi S.M.T., Wilson J.M. The capacitated lot sizing problem. a review of models and algorithms. Omega 2003, 31(5):365-378.
14. Kayan R.K., Aktürk M.S. A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. European Journal of Operational Research 2005, 167(3):624-643.
15. Koca E., Yaman H., Aktürk M.S. Lot sizing with piecewise concave production costs. INFORMS Journal on Computing 2014, 26(4):767-779.
16. Laserre J.B., Bes C., Roubellat F. The stochastic discrete dynamic lot size problem. an open-loop solution. Operations Research 1985, 33(3):684-689.
17. Luss H. Operations research and capacity expansion problems. a survey. Operations Research 1982, 30(5):907-947.
18. Merzifonluoğlu Y., Geunes J., Romeijn H. Integrated capacity, and production planning with subcontracting and overtime options. Naval Research Logistics 2007, 54(4):433-447.
19. Nahmias S. Production and operations analysis 2005, McGraw-Hill/Irwin, Boston.
20. Özen U., Doğru M.K., Tarim S.A. Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem. Omega 2012, 40:348-357.
21. Pochet Y., Wolsey L.A. Production planning by mixed integer programming 2006, Springer, New York, NY.
22. Rajagopalan S., Swaminathan J.M. A coordinated production planning model with capacity expansion and inventory management. Management Science 2001, 47(11):1562-1580.
23. Robinson P., Narayanan A., Şahin F. Coordinated deterministic dynamic demand lot-sizing problem. a review of models and algorithms. Omega 2009, 37(1):3-15.
24. Rossi R., Kiliç O.A., Tarim S.A. Piecewise linear approximations for the static-dynamic uncertainty strategy in stochastic lot-sizing. Omega 2015, 50:126-140.
25. Shabtay D., Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times. Computers & Operations Research 2004, 31(13):2279-2289.
26. Shabtay D., Kaspi M. Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research 2006, 173(1):92-107.
27. Shabtay D., Steiner G. A survey of scheduling with controllable processing times. Discrete Applied Mathematics 2007, 155(13):1643-1666.
28. Shabtay D., Steiner G. Single machine batch scheduling to minimize total completion time and resource consumption costs. Journal of Scheduling 2007, 10(4-5):255-261.
29. Shaw D.X., Wagelmans A.P.M. An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Management Science 1998, 44(6):831-838.
30. Silver E. Inventory control under a probabilistic time-varying, demand pattern. AIIE Transactions 1978, 10(4):371-379.
31. Sox C. Dynamic lot sizing problem with demand and non-stationary demand. Operations Research Letters 1997, 20:155-164.
32. Tarim S.A., Kingsman B.G. The stochastic dynamic production/inventory lot-sizing problem with service-level constraints. International Journal of Production Economics 2004, 88:105-119.
33. Tempelmeier H. A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. Omega 2011, 39:627-633.
34. Tunç H., Kiliç O., Tarim S.A., Ekşioğlu B. The cost of using stationary inventory policies when demand is non-stationary. Omega 2011, 39(4):410-415.
35. Tunç H., Kiliç O.A., Tarim S.A., Ekşioğlu B. A simple approach for assessing the cost of system nervousness. International Journal of Production Economics 2013, 141(2):619-625.
36. Tunç H., Kiliç O.A., Tarim S.A., Ekşioğlu B. A reformulation for the stochastic lot sizing problem with service-level constraints. Operations Research Letters 2014, 42(2):161-165.
37. Türkcan A., Aktürk M.S., Storer R.H. Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties. IIE Transactions 2009, 41(12):1080-1095.
38. Vargas V. An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model. European Journal of Operational Research 2009, 198:447-451.
39. Vickson R.G. Two single machine sequencing problems involving controllable job processing times. AIIE Transactions 1980, 12(3):258-262.
40. Wagner H.M., Whitin T.M. Dynamic version of the economic lot size model. Management Science 1958, 5(1):89-96.
41. Yan C., Liao Y., Banerjee A. Multi-product lot scheduling with backordering and shelf-life constraints. Omega 2013, 41:510-516.