Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Heuristic Approach for Lot Sizing and Scheduling Problem with State Dependent Setup Time

  • Han, Jung-Hee (College of Business Administration Kangwon National University)
  • Received : 2010.04.01
  • Accepted : 2010.08.04
  • Published : 2011.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over, setup overlapping, state dependent setup time as well as demand splitting are considered. For this LSSP, we develop a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we develop an efficient heuristic algorithm by combining a decomposition scheme with a local search procedure. Test results show that the developed heuristic algorithm finds a good quality (in practice, even better) feasible solution using far less computation time compared with the CPLEX, a competitive MIP solver.

Keywords

References

  1. Belvaux, G. and Wolsey, L. A. (2000), A specialized branch-and-cut system for lot-sizing problems, Management Science, 46(5), 724-738. https://doi.org/10.1287/mnsc.46.5.724.12048
  2. Belvaux, G. and Wolsey, L. A. (2001), Modeling practical lot-sizing problems as mixed- integer programs, Management Science, 47(7), 993-1007. https://doi.org/10.1287/mnsc.47.7.993.9800
  3. Clark, A. R. and Clark, S. J. (2000), Rolling-horizon lotsizing when set-up times are sequence-dependent, International Journal of Production Research, 38(10), 2287-2307. https://doi.org/10.1080/00207540050028106
  4. Drexl, A. and Haase, K. (1995), Proportional lotsizing and scheduling, International Journal of Production Economics, 40(1), 73-87. https://doi.org/10.1016/0925-5273(95)00040-U
  5. Drexl, A. and Haase, K. (1996), Sequential-analysis based randomized-regret-methods for lot-sizing and scheduling, Journal of the Operational Research Society, 47(2), 251- 265. https://doi.org/10.1057/jors.1996.23
  6. Gopalakrishnan, M. (2000), A modified framework for modeling set-up carryover in the capacitated lotsizing problem, International Journal of Production Research, 38(14), 3421-3424. https://doi.org/10.1080/002075400418324
  7. Gupta, D. and Magnusson, T. (2005), The capacitated lot-sizing and scheduling problem with sequencedependent setup costs and setup times, Computers & Operations Research, 32(4), 727-747. https://doi.org/10.1016/j.cor.2003.08.014
  8. Fleischmann, B. and Meyr, H. (1997), The general lotsizing and scheduling problem, OR Spektrum, 19, 11-21. https://doi.org/10.1007/BF01539800
  9. Meyr, H. (2000), Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, European Journal of Operational Research, 120(2), 311-326. https://doi.org/10.1016/S0377-2217(99)00159-9
  10. Han, J., Lee, Y., Kim, S., and Park, E. (2007), An alternative modeling for lot-sizing and scheduling problem with a decomposition based heuristic algorithm, Journal of the Korean Institute of Industrial Engineers, 33, 373-380.
  11. Meyr, H. (2002), Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, 139(2), 277-292. https://doi.org/10.1016/S0377-2217(01)00373-3
  12. Porkka, P., Vepsalainen, A. P., and Kuula, M. (2003), Multiperiod production planning carrying over setup time, International Journal of Production Research, 41(6), 1133-1148. https://doi.org/10.1080/0020754021000042995
  13. Sox, C. R. and Gao, Y. (1999), The capacitated lot sizing problem with setup carry-over, IIE Transactions, 31(2), 173-181.
  14. Suerie, C. and Stadtler, H. (2003), The capacitated lotsizing problem with linked lot sizes, Management Science, 49(8), 1039-1054. https://doi.org/10.1287/mnsc.49.8.1039.16406
  15. Suerie, C. (2006), Modeling of period overlapping setup times, European Journal of Operational Research, 174(2), 874-886. https://doi.org/10.1016/j.ejor.2005.03.033