Dynamic lot sizing problem for a warm/cold process

IIE Transactions (Institute of Industrial Engineers)

Volumn 38, Issue 11, 2006, Pages 1027-1044

  Toy, Ayhan Özgür ^a   Berk, Emre ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DYNAMIC PROGRAMMING; OPTIMIZATION; PLANNING;

COLD PROCESS; DYNAMIC LOT SIZING PROBLEM; LINEAR-TIME SOLUTION ALGORITHM; POLYNOMIAL-TIME SOLUTION ALGORITHM; WARM PROCESS;

PROCESS ENGINEERING;

EID: 33748503717     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170600854511     Document Type: Article

References (30)

1. Aggarwal, A. and Park, J. (1989) Sequential searching in multidimensional monotone arrays. Yorktown Heights NY: IBM T.J. Watson Research Center. Research Report RC 15128
2. Aggarwal, A. and Park, J. (1993) Improved algorithms for economic lot size problems Operations Research, 41(3), pp. 549-571. http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=41&iss=3&firstpage=549 [CSA]
3. Agra, A. and Constantino, M. (1999) Lot sizing with backordering and start-ups: The case of Wagner-Whitin costs Operations Research Letters, 25, pp. 81-88. http://dx.doi.org/10.1016%2FS0167-6377%2899%2900030-9
4. Allahverdi, A. and Gupta, J. and Aldowaisan, T. (1999) A review of scheduling research involving setup considerations Omega, 27, pp. 219-239. http://dx.doi.org/10.1016%2FS0305-0483%2898%2900042-5 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=27&iss=&firstpage=219 [CSA]
5. Baker, K. and Dixon, P. and Magazine, J. and Silver, E. (1978) An algorithm for the dynamic lot-size problem with time-varying production capacity constraints Management Science, 24(16), pp. 1710-1720. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=24&iss=16&firstpage=1710 [CSA]
6. Bitran, G. and Matsuo, H. (1986) Approximation formulations for the single-product capacitated lot size problem Operations Research, 34(1), pp. 63-74. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=34&iss=1&firstpage=63 [CSA]
7. Bitran, G. and Yanasse, H. (1982) Computational complexity of the capacitated lot size problem Management Science, 28(10), pp. 1174-1186. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=28&iss=10&firstpage=1174 [CSA]
8. Blackburn, J. and Kunreuther, H. (1974) Planning horizons for the dynamic lot size model with backlogging Management Science, 21(3), pp. 251-255. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=21&iss=3&firstpage=251 [CSA]
9. Bruggemann, W. and Jahnke, H. (2000) The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability European Journal of Operational Research, 124, pp. 511-528. http:// dx.doi.org/10.1016%2FS0377-2217%2899%2900190-3 [CROSSREF]
10. Eiamkanchanalai, S. and Banerjee, A. (1999) Production lot sizing with variable production rate and explicit idle capacity cost International Journal of Production Economics, 59, pp. 251-259. http://dx.doi.org/ 10.1016%2FS0925-5273%2898%2900102-9 [CROSSREF]
11. Eppen, G. and Martin, R. (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition Operations Research, 35(6), pp. 832-848. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=35&iss=6&firstpage=832 [CSA]
12. Eppstein, D. (1990) Sequence comparison with mixed convex and concave costs Journal of Algorithms, 11, pp. 85-101. http://dx.doi.org/ 10.1016%2F0196-6774%2890%2990031-9 [CROSSREF]
13. Fleischmann, B. (1990) The discrete lot-sizing and scheduling problem European Journal of Operational Research, 44, pp. 337-348. http:// dx.doi.org/10.1016%2F0377-2217%2890%2990245-7 [CROSSREF]
14. Florian, M. and Klein, M. (1971) Deterministic production planning with concave costs and capacity constraints Management Science, 18(1), pp. 12-20. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=18&iss=1&firstpage=12 [CSA]
15. Gallego, G. (1993) Reduced production rates in the economic lot scheduling problem International Journal of Production Research, 31, pp. 1035-1046. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=31&iss=&firstpage=1035
16. Hindi, K. (1995a) Efficient solution of the single-item, capacitated lot-sizing problem with start-up and reservation costs Journal of the Operational Research Society, 46(10), pp. 1223-1236. http://dx.doi.org/ 10.2307%2F2584618 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0160-5682&vol=46&ss=10&firstpage=1223 [CSA]
17. Hindi, K. (1995b) Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search Computers & Industrial Engineering, 28(4), pp. 701-707. http:// dx.doi.org/10.1016%2F0360-8352%2895%2900027-X [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=&vol=28&iss=10&firstpage=701 [CSA]
18. Jagannathan, R. and Rao, M. (1973) A class of deterministic production planning problems Management Science, 19(11), pp. 1295-1300. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=19&iss=11&firstpage=1295 [CSA]
19. Karimi, B. (2003) The capacitated lot sizing problem: A review of models and algorithms Omega, 31(5), pp. 365-378. http://dx.doi.org/ 10.1016%2FS0305-0483%2803%2900059-8" [CROSSREF] http://www.csa.com/ htbin/linkabst.cgi?issn=0030-2228&vol=31&iss=5&firstpage=365 [CSA]
20. Karmarkar, U. and Kekre, S. and Kekre, S. (1987) The dynamic lot-sizing problem with startup and reservation costs Operations Research, 35(3), pp. 389-398. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=35&iss=3&firstpage=389 [CSA]
21. Loparic, M. and Marchand, H. and Wolsey, L. (2003) Dynamic knapsack sets and capacitated lot-sizing Mathematical Programming Series B, 95, pp. 53-59. http://dx.doi.org/10.1007%2Fs10107-002-0341-y [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=&vol=95&iss=3&firstpage=53 [CSA]
22. Love, S. (1973) Bounded production and inventory models with piecewise concave costs Management Science, 20(3), pp. 313-318. http://www.csa.com/ htbin/linkabst.cgi?issn=0025-1909&vol=20&iss=3&firstpage=313 [CSA]
23. Manne, A. (1958) Programming of economic lot sizes Management Science, 4(2), pp. 115-135. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=4&iss=2&firstpage=115 [CSA]
24. Moon, I. and Gallego, G. and Simchi-Levi, D. (1991) Controllable production rates in a family production context International Journal of Production Research, 29, pp. 2459-2470. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=29&iss=&firstpage=2459 [CSA]
25. Pochet, Y. and Wolsey, L. (1995) Algorithms and reformulations for lot sizing problems DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20, pp. 245-293. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=20&iss=&firstpage=245 [CSA]
26. Robinson, E. and Sahin, F. (2001) Economic production lot sizing with periodic costs and overtime Decision Sciences Journal, 32(3), pp. 423-452. http://www.csa.com/htbin/ linkabst.cgi?issn=1540-4595&vol=32&iss=3&firstpage=423 [CSA]
27. Silver, E. (1990) Deliberately slowing down output in a family production context International Journal of Production Research, 28, pp. 17-27. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=28&iss=&firstpage=17 [CSA]
28. Wagner, H. and Whitin, T. (1958) Dynamic version of the economic lot size model Management Science, 5(1), pp. 89-96. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=5&iss=1&firstpage=89 [CSA]
29. Wolsey, L. (1995) Progress with single-item lot-sizing European Journal of Operational Research, 86, pp. 395-401. http://dx.doi.org/ 10.1016%2F0377-2217%2894%2900341-9 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=86&iss=&firstpage=395 [CSA]
30. Zangwill, W. (1966) A deterministic multi-period production scheduling model with backlogging Management Science, 13(1), pp. 105-119. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=13&iss=1&firstpage=105 [CSA]