A hierarchical approach for the capacitated lot-sizing and scheduling problem with a special structure of sequence-dependent setups

International Journal of Production Research

Volumn 49, Issue 24, 2011, Pages 7425-7439

  Kwak, Ik Soon ^a   Jeong, In Jae ^a  

^a Hanyang University   (South Korea)

Author keywords

Capacitated lot sizing; Sequence dependent; Two level hierarchical plan

Indexed keywords

CAPACITATED LOT SIZING; DYNAMIC DEMAND; HIERARCHICAL APPROACH; HIERARCHICAL METHOD; INVENTORY HOLDING; LOT SIZING PROBLEMS; MULTI-PRODUCTS; PRODUCTION QUANTITY; SCHEDULING PROBLEM; SEQUENCE DEPENDENT SETUPS; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME; SETUP COSTS; SOLUTION APPROACH; SPECIAL FORMS; SPECIAL STRUCTURE; TWO-LEVEL HIERARCHICAL PLAN; UNIFORM STRUCTURE;

HEURISTIC METHODS; SCHEDULING;

PROBLEM SOLVING;

EID: 84855757121     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.543170     Document Type: Article

References (26)

1. Almada-Lobo, B., et al., 2007. Single machine multi-product capacitated lot-sizing and scheduling problem with sequence-dependent setups. International Journal of Production Research, 45 (20), 4873-4894. (Pubitemid 47352796)
2. Almada-Lobo, B., Oliveira, J.F., and Carravilla, M.A., 2008. A note on 'The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times'. Computers & Operations Research, 35 (4), 1374-1376. (Pubitemid 47558962)
3. Belvaux, G. and Wolsey, L.A., 2001. Modelling practical lot-sizing problems as mixed-integer programs. Management Science, 47 (7), 993-1007. (Pubitemid 34192821)
4. Bitran, G. and Yanasse, H.H., 1982. Computational complexity of the capacitated lot size problem. Management Science, 28 (10), 1174-1186.
5. Chen, W.H. and Thizy, J.M., 1990. Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research, 26 (1), 29-72.
6. Coleman, B.J., 1992. Technical note: a simple model for optimizing the single machine early/tardy problem with sequence-dependent setups. Production and Operations Management, 1 (2), 225-228.
7. Dogramaci, A., Panayiotopoulos, J.C., and Adam, N.R., 1981. The dynamic lot-sizing problem for multiple items under limited capacity. AIIE Transactions, 13 (4), 294-303. (Pubitemid 12458020)
8. Drexl, A. and Kimms, A., 1997. Lot-sizing and scheduling - survey and extensions. European Journal of Operational Research, 99 (2), 221-235.
9. Eisenhut, P.S., 1975. A dynamic lot sizing algorithm with capacity constraints. AIIE Transactions, 7 (2), 170-176.
10. Eren, T. and Guner, E., 2006. A bicriteria scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 179 (1), 378-385. (Pubitemid 44247123)
11. Florian, M., Lenstra, J.K., and Rinnoy Kan, A.H.G., 1980. Deterministic production planning: algorithms and complexity. Management Science, 26, 669-679. (Pubitemid 11442296)
12. Gopalakrishnan, M., Miller, D.M., and Schmidt, C.P., 1995. A framework for modeling setup carryover in the capacitated lot sizing problem. International Journal of Production Research, 33 (7), 1973-1988.
13. Gupta, D. and Magnusson, T., 2005. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers & Operations Research, 32 (4), 727-747.
14. Haase, K., 1996. Capacitated lot-sizing with sequence-dependent setup costs. Operations Research Spectrum, 18 (1), 51-59.
15. Haase, K. and Kimms, A., 2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66 (2), 159-169.
16. Kang, S., Kavindra, M., and Thomas, L.J., 1999. Lotsizing and scheduling on parallel machines with sequence dependent setup cost. Management Science, 45 (2), 273-289.
17. Karimi, B., Fatemi Ghomi, S.M.T., and Wilson, J.M., 2003. The capacitated lot-sizing problem: a review of models and algorithms. Omega, 31 (5), 365-378. (Pubitemid 37007074)
18. Lambrecht, M. and Vanderveken, H., 1979. Heuristic procedures for the single operation, multi-item loading problem. AIIE Transactions, 11 (4), 319-326. (Pubitemid 10450558)
19. Meyr, H., 2000. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research, 120 (2), 311-326. (Pubitemid 30542650)
20. Meyr, H., 2002. Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139 (2), 277-292. (Pubitemid 34201239)
21. Mohammadi, M., et al., 2010. MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups. International Journal of Production Research, 48 (10), 2957-2973.
22. Monma, C.L. and Potts, C.N., 1989. On the complexity of scheduling with batch setup times. Operations Research, 37 (5), 798-804.
23. Nemhauser, G.L. and Wolsey, L.A., 1988. Integer and combinatorial optimization. New York: Wiley.
24. Park, H., Hong, Y., and Chang, S., 2002. An efficient scheduling algorithm for the hot coil making in the steel mini-mill. Production Planning & Control, 13 (3), 298-306. (Pubitemid 34586383)
25. Pinedo, M., 1995. Scheduling: theory, algorithms and systems. Englewood Cliffs, NJ: Prentice-Hall.
26. Thizy, J.M. and Van Wassenhove, L.N., 1985. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: a heuristic implementation. IIE Transactions, 17 (2), 64-74.