Single item lot-sizing problem for a warm/cold process with immediate lost sales

European Journal of Operational Research

Volumn 187, Issue 3, 2008, Pages 1251-1267

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

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Dynamic lot sizing; Lost sales; Scheduling; Setup costs; Setup times; Warm cold process

Indexed keywords

DYNAMIC PROGRAMMING; OPERATING COSTS; PRODUCTION CONTROL; SALES; SCHEDULING;

DYNAMIC LOT-SIZING PROBLEM; LOST SALES; SETUP COSTS; SETUP TIMES; WARM/COLD PROCESS;

PROBLEM SOLVING;

EID: 36849064379     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.06.070     Document Type: Article

References (32)

1. Aggarwal A., and Park J.K. Improved algorithms for economic lot size problems. Operations Research 41 3 (1993) 549-571
2. Agra A., and Constantino M. Lot sizing with backordering and start-ups: The case of Wagner-Whitin costs. Operations Research Letters 25 (1999) 81-88
3. Aksen D., Altinkemer K., and Chand S. The single-item lot-sizing problem with immediate lost sales. European Journal of Operational Research 147 (2003) 558-566
4. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega 27 (1999) 219-239
5. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y., this issue. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, doi:10.1016/j.ejor.2006.06.060.
6. Berk, E., Toy, A.Ö., Hazi{dotless}r, Ö., 2006. Single item lot sizing problem for a warm/cold process with immediate lost sales: Extended version with proofs. Working Paper #2006-1, Faculty of Business Administration, Bilkent University.
7. Bitran G.R., and Yanasse H.H. Computational complexity of the capacitated lot size problem. Management Science 28 10 (1982) 1174-1186
8. Brahimi N., Dauzere-Peres S., Najid N.M., and Nordli A. Single item lot sizing problems. European Journal of Operational Research 168 (2006) 511-528
9. Bruggemann W., and Jahnke H. The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability. European Journal of Operational Research 124 (2000) 511-528
10. 2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Science 34 (1988) 420-426
11. Eiamkanchanalai S., and Banerjee A. Production lot sizing with variable production rate and explicit idle capacity cost. International Journal of Production Economics 59 (1999) 251-259
12. Eppen G.D., and Martin R.K. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research 35 6 (1987) 832-848
13. Fleischmann B. The discrete lot-sizing and scheduling problem. European Journal of Operational Research 44 (1990) 337-348
14. Florian M., and Klein M. Deterministic production planning with concave costs and capacity constraints. Management Science 18 1 (1971) 12-20
15. Gallego G. Reduced production rates in the economic lot scheduling problem. International Journal of Production Research 31 (1993) 1035-1046
16. Gupta D., and Magnusson T. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers and Operations Research 32 (2005) 727-747
17. Hindi K.S. Efficient solution of the single-item, capacitated lot-sizing problem with start-up and reservation costs. Journal of Operational Research Society 46 10 (1995) 1223-1236
18. Hindi K.S. Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search. Computers and Industrial Engineering 28 4 (1995) 701-707
19. Karimi B., Fatemi Ghomi S.M.T., and Wilson J.M. The capacitated lot sizing problem: A review of models and algorithms. Omega 31 5 (2003) 365-378
20. Karmarkar U.S., Kekre S., and Kekre S. The dynamic lot-sizing problem with startup and reservation costs. Operations Research 35 3 (1987) 389-398
21. Liu, X., Wang, C., Chu, F., Chu, C., 2004. A forward algorithm for capacitated lot sizing problem with lost sales. In: Proceedings of the 5th World Congress on Intelligent Control and Automation, June 15-19.
22. Loparic M., Marchand H., and Wolsey L.A. Dynamic knapsack sets and capacitated lot-sizing. Mathematical Programming Series B 95 (2003) 53-59
23. Manne A.S. Programming of economic lot sizes. Management Science 4 2 (1958) 115-135
24. Moon I., Gallego G., and Simchi-Levi D. Controllable production rates in a family production context. International Journal of Production Research 29 (1991) 2459-2470
25. Pochet Y., and Wolsey L.A. Algorithms and reformulations for lot sizing problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (1995) 245-293
26. Robinson E.P., and Sahin F. Economic production lot sizing with periodic costs and overtime. Decision Sciences Journal 32 3 (2001) 423-452
27. Sandbothe R.A., and Thompson G.L. A forward algorithm for the capacitated lot size model with stockouts. Operations Research 38 3 (1990) 474-486
28. Silver E.A. Deliberately slowing down output in a family production context. International Journal of Production Research 28 (1990) 17-27
29. Toy A.O., and Berk E. Dynamic lot sizing problem for a warm/cold process. IIE Transactions 38 11 (2006) 1027-1044
30. 3) algorithm for the economic lot-sizing problem with constant capacities. Management Science 42 (1996) 142-150
31. Wagner H.M., and Whitin T.M. Dynamic version of the economic lot size model. Management Science 5 1 (1958) 89-96
32. Wolsey L.A. Progress with single-item lot-sizing. European Journal of Operational Research 86 (1995) 395-401