메뉴 건너뛰기




Volumn 63, Issue , 2015, Pages 72-82

A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times

Author keywords

Capacitated lot sizing and scheduling; Lagrangian relaxation; Sequence dependent setup; Simulated annealing; Unrelated parallel machines

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MANUFACTURE; OPTIMIZATION; SCHEDULING ALGORITHMS; SEMICONDUCTOR DEVICE MANUFACTURE; SIMULATED ANNEALING;

EID: 84929643507     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2015.04.010     Document Type: Article
Times cited : (53)

References (38)
  • 1
    • 79951836660 scopus 로고    scopus 로고
    • The lot sizing and scheduling of sand casting operations
    • E. Hans, and S.v.d. Velde The lot sizing and scheduling of sand casting operations Int J Prod Res 49 9 2011 2481 2499
    • (2011) Int J Prod Res , vol.49 , Issue.9 , pp. 2481-2499
    • Hans, E.1
  • 2
    • 79951819843 scopus 로고    scopus 로고
    • An improved Lagrangean relaxation algorithm for the dynamic batching decision problem
    • L. Tang, Y. Meng, and J. Liu An improved Lagrangean relaxation algorithm for the dynamic batching decision problem Int J Prod Res 49 9 2011 2501 2517
    • (2011) Int J Prod Res , vol.49 , Issue.9 , pp. 2501-2517
    • Tang, L.1    Meng, Y.2    Liu, J.3
  • 3
    • 79951815554 scopus 로고    scopus 로고
    • A hybrid general lot-sizing and scheduling formulation for a production process with a two-stage product structure
    • S. Transchel, S. Minner, J. Kallrath, N. Löhndorf, and U. Eberhard A hybrid general lot-sizing and scheduling formulation for a production process with a two-stage product structure Int J Prod Res 49 9 2011 2457 2461
    • (2011) Int J Prod Res , vol.49 , Issue.9 , pp. 2457-2461
    • Transchel, S.1    Minner, S.2    Kallrath, J.3    Löhndorf, N.4    Eberhard, U.5
  • 4
    • 0019032810 scopus 로고
    • Deterministic production planning algorithms and complexity
    • M. Florian, J. Lenstra, and A.R. Kan Deterministic production planning algorithms and complexity Manag Sci 26 7 1980 669 679
    • (1980) Manag Sci , vol.26 , Issue.7 , pp. 669-679
    • Florian, M.1    Lenstra, J.2    Kan, A.R.3
  • 5
    • 31444445264 scopus 로고    scopus 로고
    • A Tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
    • B. Karimi, S.M.T. Fatemi-Ghomi, and J.M. Wilson A Tabu search heuristic for solving the CLSP with backlogging and set-up carry-over J Oper Res Soc 57 2 2006 140 147
    • (2006) J Oper Res Soc , vol.57 , Issue.2 , pp. 140-147
    • Karimi, B.1    Fatemi-Ghomi, S.M.T.2    Wilson, J.M.3
  • 6
    • 0036271225 scopus 로고    scopus 로고
    • Technical note: New results for the capacitated lot sizing problem with overtime decisions and setup times
    • L. Özdamar,Bilbil, and M.-C. Portmann Technical note: new results for the capacitated lot sizing problem with overtime decisions and setup times Prod Planning & Control 13 1 2002 2 10
    • (2002) Prod Planning & Control , vol.13 , Issue.1 , pp. 2-10
    • Özdamar, L.1    Portmann, M.-C.2
  • 7
    • 0038617642 scopus 로고    scopus 로고
    • An effective heuristic for the CLSP with set-up times
    • K.S. Hindi, K. Fleszar, and C. Charalambous An effective heuristic for the CLSP with set-up times J Oper Res Soc 54 5 2003 490 498
    • (2003) J Oper Res Soc , vol.54 , Issue.5 , pp. 490-498
    • Hindi, K.S.1    Fleszar, K.2    Charalambous, C.3
  • 8
    • 0345581411 scopus 로고    scopus 로고
    • Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
    • L. Özdamar, and G. Barbarosoʇlu Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem J Oper Res Soc 50 8 1999 810 825
    • (1999) J Oper Res Soc , vol.50 , Issue.8 , pp. 810-825
    • Özdamar, L.1    Barbarosoʇlu, G.2
  • 9
    • 0141733592 scopus 로고    scopus 로고
    • Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows
    • H. Stadtler Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows Oper Res 51 3 2003 487 502
    • (2003) Oper Res , vol.51 , Issue.3 , pp. 487-502
    • Stadtler, H.1
  • 10
    • 60349090312 scopus 로고    scopus 로고
    • Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
    • F. Sahling, L. Buschkühl, H. Tempelmeier, and S. Helber Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic Comput Oper Res 36 9 2009 2546 2553
    • (2009) Comput Oper Res , vol.36 , Issue.9 , pp. 2546-2553
    • Sahling, F.1    Buschkühl, L.2    Tempelmeier, H.3    Helber, S.4
  • 11
    • 84863221755 scopus 로고    scopus 로고
    • An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
    • Online first
    • T. Wu, L. Shi, and J. Song An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times Online first Ann Oper Res 2011 10.1007/s10479-011-1026-9
    • (2011) Ann Oper Res
    • Wu, T.1    Shi, L.2    Song, J.3
  • 12
    • 33748422386 scopus 로고    scopus 로고
    • A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
    • F.M.B. Toledo, and V.A. Armentano A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines Eur J Oper Res 175 2 2006 1070 1083
    • (2006) Eur J Oper Res , vol.175 , Issue.2 , pp. 1070-1083
    • Toledo, F.M.B.1    Armentano, V.A.2
  • 13
    • 78650202769 scopus 로고    scopus 로고
    • A heuristic approach for a multi-product capacitated lot-sizing problem with pricing
    • R.G. Gonzalez-Ramirez, N.R. Smith, and R.G. Askin A heuristic approach for a multi-product capacitated lot-sizing problem with pricing Int J Prod Res 49 4 2011 1173 1196
    • (2011) Int J Prod Res , vol.49 , Issue.4 , pp. 1173-1196
    • Gonzalez-Ramirez, R.G.1    Smith, N.R.2    Askin, R.G.3
  • 14
    • 36448972678 scopus 로고    scopus 로고
    • A new Dantzig-Wolfe reformulation and Branch-and-Price algorithm for the capacitated lot-sizing problem with setup times
    • Z. Degraeve, and R. Jans A new Dantzig-Wolfe reformulation and Branch-and-Price algorithm for the capacitated lot-sizing problem with setup times Oper Res 55 5 2007 909 920
    • (2007) Oper Res , vol.55 , Issue.5 , pp. 909-920
    • Degraeve, Z.1    Jans, R.2
  • 15
    • 77954386033 scopus 로고    scopus 로고
    • An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times
    • T. Wu, L. Shi, and N.A. Duffie An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times IEEE Trans Autom Sci Eng 7 3 2010 500 511
    • (2010) IEEE Trans Autom Sci Eng , vol.7 , Issue.3 , pp. 500-511
    • Wu, T.1    Shi, L.2    Duffie, N.A.3
  • 16
    • 0010775487 scopus 로고    scopus 로고
    • Capacitated lot-sizing with sequence dependent setup costs
    • K. Haase Capacitated lot-sizing with sequence dependent setup costs OR Spectrum 18 1 1996 51 59
    • (1996) OR Spectrum , vol.18 , Issue.1 , pp. 51-59
    • Haase, K.1
  • 17
    • 61449139202 scopus 로고    scopus 로고
    • An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups
    • A. Kovács, K.N. Brown, and S.A. Tarim An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups Int J Prod Econ 118 1 2009 282 291
    • (2009) Int J Prod Econ , vol.118 , Issue.1 , pp. 282-291
    • Kovács, A.1    Brown, K.N.2    Tarim, S.A.3
  • 18
    • 41149118126 scopus 로고    scopus 로고
    • Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
    • P. Beraldi, G. Ghiani, A. Grieco, and E. Guerriero Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs Comput Oper Res 35 11 2008 3644 3656
    • (2008) Comput Oper Res , vol.35 , Issue.11 , pp. 3644-3656
    • Beraldi, P.1    Ghiani, G.2    Grieco, A.3    Guerriero, E.4
  • 19
    • 84861189507 scopus 로고    scopus 로고
    • Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
    • J.C. Lang, and Z.-J.M. Shen Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions Eur J Oper Res 214 3 2011 595 605
    • (2011) Eur J Oper Res , vol.214 , Issue.3 , pp. 595-605
    • Lang, J.C.1    Shen, Z.-J.M.2
  • 20
    • 79955056703 scopus 로고    scopus 로고
    • Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics
    • R.J.W. James, and B. Almada-Lobo Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics Comput Oper Res 38 12 2011 1816 1825
    • (2011) Comput Oper Res , vol.38 , Issue.12 , pp. 1816-1825
    • James, R.J.W.1    Almada-Lobo, B.2
  • 22
    • 0242301580 scopus 로고    scopus 로고
    • Multiperiod production planning carrying over set-up time
    • P. Porkka, A.P.J. Vepsäläinen, and M. Kuula Multiperiod production planning carrying over set-up time Int J Prod Res 41 6 2003 1133 1148
    • (2003) Int J Prod Res , vol.41 , Issue.6 , pp. 1133-1148
    • Porkka, P.1    Vepsäläinen, A.P.J.2    Kuula, M.3
  • 23
    • 0032627684 scopus 로고    scopus 로고
    • The capacitated lot sizing problem with setup carry-over
    • C.R. Sox, and Y. Gao The capacitated lot sizing problem with setup carry-over IIE Trans 31 2 1999 173 181
    • (1999) IIE Trans , vol.31 , Issue.2 , pp. 173-181
    • Sox, C.R.1    Gao, Y.2
  • 24
    • 0035382004 scopus 로고    scopus 로고
    • A Tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
    • M. Gopalakrishnan, D. Ke, J.-M. Bourjolly, and S. Mohan A Tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover Manag Sci 47 6 2001 851 863
    • (2001) Manag Sci , vol.47 , Issue.6 , pp. 851-863
    • Gopalakrishnan, M.1    Ke, D.2    Bourjolly, J.-M.3    Mohan, S.4
  • 25
    • 79951846026 scopus 로고    scopus 로고
    • Lot sizing and scheduling: Industrial extensions and research opportunities
    • A. Clark, B. Almada-Lobo, and C. Almeder Lot sizing and scheduling: industrial extensions and research opportunities Int J Prod Res 49 9 2011 2457 2461
    • (2011) Int J Prod Res , vol.49 , Issue.9 , pp. 2457-2461
    • Clark, A.1    Almada-Lobo, B.2    Almeder, C.3
  • 26
    • 0041511823 scopus 로고    scopus 로고
    • The capacitated lot sizing problem: A review of models and algorithms
    • B. Karimi, S.M.T. Fatemi Ghomi, and J.M. Wilson The capacitated lot sizing problem: a review of models and algorithms Omega 31 5 2003 365 378
    • (2003) Omega , vol.31 , Issue.5 , pp. 365-378
    • Karimi, B.1    Fatemi Ghomi, S.M.T.2    Wilson, J.M.3
  • 27
    • 5144227971 scopus 로고    scopus 로고
    • Single item lot-sizing problems with backlogging on a single machine at a finite production rate
    • Y. Song, and G.H. Chan Single item lot-sizing problems with backlogging on a single machine at a finite production rate Eur J Oper Res 161 1 2005 191 202
    • (2005) Eur J Oper Res , vol.161 , Issue.1 , pp. 191-202
    • Song, Y.1    Chan, G.H.2
  • 28
    • 53049101103 scopus 로고    scopus 로고
    • A heuristic approach for big bucket multi-level production planning problems
    • K. AkartunalI, and A.J. Miller A heuristic approach for big bucket multi-level production planning problems Eur J Oper Res 193 2 2009 396 411
    • (2009) Eur J Oper Res , vol.193 , Issue.2 , pp. 396-411
    • Akartunali, K.1    Miller, A.J.2
  • 29
    • 79959695223 scopus 로고    scopus 로고
    • An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
    • T. Wu, L. Shi, J. Geunes, and K. AkartunalI An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging Eur J Oper Res 214 2 2011 428 441
    • (2011) Eur J Oper Res , vol.214 , Issue.2 , pp. 428-441
    • Wu, T.1    Shi, L.2    Geunes, J.3    Akartunali, K.4
  • 30
    • 33645304837 scopus 로고    scopus 로고
    • Lot-sizing with production and delivery time windows
    • L.A. Wolsey Lot-sizing with production and delivery time windows Math Program 107 3 2006 471 489
    • (2006) Math Program , vol.107 , Issue.3 , pp. 471-489
    • Wolsey, L.A.1
  • 31
    • 68249130920 scopus 로고    scopus 로고
    • Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
    • N. Brahimi, S. Dauzere-Peres, and L.A. Wolsey Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times Comput Oper Res 37 1 2010 182 188
    • (2010) Comput Oper Res , vol.37 , Issue.1 , pp. 182-188
    • Brahimi, N.1    Dauzere-Peres, S.2    Wolsey, L.A.3
  • 32
    • 79951839865 scopus 로고    scopus 로고
    • Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
    • N. Absia, S. Kedad-Sidhoum, and S. Dauzere-Peres Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales Int J Prod Res 49 9 2011 2551 2566
    • (2011) Int J Prod Res , vol.49 , Issue.9 , pp. 2551-2566
    • Absia, N.1    Kedad-Sidhoum, S.2    Dauzere-Peres, S.3
  • 34
    • 67649794649 scopus 로고    scopus 로고
    • Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
    • D. Quadt, and H. Kuhn Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over Nav Res Logist 56 4 2009 366 384
    • (2009) Nav Res Logist , vol.56 , Issue.4 , pp. 366-384
    • Quadt, D.1    Kuhn, H.2
  • 35
    • 0033903519 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
    • H. Meyr Simultaneous lotsizing and scheduling by combining local search with dual reoptimization Eur J Oper Res 120 2 2000 311 326
    • (2000) Eur J Oper Res , vol.120 , Issue.2 , pp. 311-326
    • Meyr, H.1
  • 36
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling on parallel machines
    • H. Meyr Simultaneous lotsizing and scheduling on parallel machines Eur J Oper Res 139 2 2002 277 292
    • (2002) Eur J Oper Res , vol.139 , Issue.2 , pp. 277-292
    • Meyr, H.1
  • 37
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • M.L. Fisher The Lagrangian relaxation method for solving integer programming problems Manag Sci 27 1 1981 1 18
    • (1981) Manag Sci , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 38
    • 0016025814 scopus 로고
    • Validation of subgradient optimization
    • M. Held, P. Wolfe, and H.P. Crowder Validation of subgradient optimization Math Program 6 1 1974 62 88
    • (1974) Math Program , vol.6 , Issue.1 , pp. 62-88
    • Held, M.1    Wolfe, P.2    Crowder, H.P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.