메뉴 건너뛰기




Volumn 244, Issue 1, 2015, Pages 3-12

A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem

Author keywords

Heuristic; Lagrangian relaxation; Lot sizing; Production planning; Scheduling

Indexed keywords

DECISION THEORY; LAGRANGE MULTIPLIERS; NP-HARD; PLANNING; PRODUCTION CONTROL;

EID: 84930485973     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2015.01.034     Document Type: Conference Paper
Times cited : (32)

References (42)
  • 1
    • 0001233812 scopus 로고
    • Improved algorithms for economic lot-size problems
    • Aggarwal A., and Park J. Improved algorithms for economic lot-size problems Operations Research 41 3 1993 549 571
    • (1993) Operations Research , vol.41 , Issue.3 , pp. 549-571
    • Aggarwal, A.1    Park, J.2
  • 5
    • 0002381223 scopus 로고
    • Machine scheduling via disjunctive graphs: An implicit enumeration algorithm
    • Balas E. Machine scheduling via disjunctive graphs: An implicit enumeration algorithm Operations Research 17 6 1969 941 957
    • (1969) Operations Research , vol.17 , Issue.6 , pp. 941-957
    • Balas, E.1
  • 6
    • 0002577952 scopus 로고
    • Analysis of relaxations for the multi-item capacitated lot-sizing problem
    • Chen W.-H., and Thizy J.-M. Analysis of relaxations for the multi-item capacitated lot-sizing problem Annals of Operations Research 26 1 1990 29 72
    • (1990) Annals of Operations Research , vol.26 , Issue.1 , pp. 29-72
    • Chen, W.-H.1    Thizy, J.-M.2
  • 12
  • 13
    • 33748884885 scopus 로고    scopus 로고
    • Simultaneous lot sizing and scheduling for multi-product multi-level production
    • Fandel G., and Stammen-Hegene C. Simultaneous lot sizing and scheduling for multi-product multi-level production International journal of Production Economics 104 2 2006 308 316
    • (2006) International Journal of Production Economics , vol.104 , Issue.2 , pp. 308-316
    • Fandel, G.1    Stammen-Hegene, C.2
  • 14
    • 0026208005 scopus 로고
    • Simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time
    • Federgruen A., and Tzur M. Simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time Management Science 37 8 1991 909 925
    • (1991) Management Science , vol.37 , Issue.8 , pp. 909-925
    • Federgruen, A.1    Tzur, M.2
  • 15
    • 0019477279 scopus 로고
    • The lagrangian relaxation method of solving integer programming problems
    • Fisher M.L. The lagrangian relaxation method of solving integer programming problems Management Science 27 1 1981 1 18
    • (1981) Management Science , vol.27 , Issue.1 , pp. 1-18
    • Fisher, M.L.1
  • 16
    • 0001947856 scopus 로고
    • Probabilistic learning combinations of local job-shop scheduling rules
    • J. Muth, G. Thompson, Prentice Hall Englewood Cliffs
    • Fisher H., and Thompson G. Probabilistic learning combinations of local job-shop scheduling rules J. Muth, G. Thompson, Industrial scheduling 1963 Prentice Hall Englewood Cliffs 225 251
    • (1963) Industrial Scheduling , pp. 225-251
    • Fisher, H.1    Thompson, G.2
  • 18
    • 0008655177 scopus 로고    scopus 로고
    • The general lotsizing and scheduling problem
    • Fleischmann B., and Meyr H. The general lotsizing and scheduling problem OR Spektrum 19 1 1997 11 21
    • (1997) OR Spektrum , vol.19 , Issue.1 , pp. 11-21
    • Fleischmann, B.1    Meyr, H.2
  • 21
    • 5644274147 scopus 로고    scopus 로고
    • The capacitated lot-sizing and scheduling problem with sequence-dependant setup costs and setup times
    • Gupta D., and Magnusson T. The capacitated lot-sizing and scheduling problem with sequence-dependant setup costs and setup times Computers & Operations Research 32 4 2005 727 747
    • (2005) Computers & Operations Research , vol.32 , Issue.4 , pp. 727-747
    • Gupta, D.1    Magnusson, T.2
  • 22
    • 0033690423 scopus 로고    scopus 로고
    • Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities
    • Haase K., and Kimms A. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities International Journal of Production Economics 66 2 2000 159 169
    • (2000) International Journal of Production Economics , vol.66 , Issue.2 , pp. 159-169
    • Haase, K.1    Kimms, A.2
  • 23
    • 0033102020 scopus 로고    scopus 로고
    • Deterministic job shop scheduling: Past present and future
    • Jain A., and Meeran S. Deterministic job shop scheduling: Past present and future European Journal of Operational Research 113 2 1999 390 434
    • (1999) European Journal of Operational Research , vol.113 , Issue.2 , pp. 390-434
    • Jain, A.1    Meeran, S.2
  • 24
    • 79955056703 scopus 로고    scopus 로고
    • Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics
    • James R., and Almada-Lobo B. Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics Computers & Operations Research 38 12 2011 1816 1825
    • (2011) Computers & Operations Research , vol.38 , Issue.12 , pp. 1816-1825
    • James, R.1    Almada-Lobo, B.2
  • 25
    • 33644685638 scopus 로고    scopus 로고
    • An approach for integrated scheduling and lot-sizing
    • Jodlbauer H. An approach for integrated scheduling and lot-sizing European Journal of Operational Research 172 2 2006 386 400
    • (2006) European Journal of Operational Research , vol.172 , Issue.2 , pp. 386-400
    • Jodlbauer, H.1
  • 26
    • 0037410965 scopus 로고    scopus 로고
    • A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling
    • Kim Y., Park K., and Ko J. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling Computers & Operations research 30 8 2003 1151 1171
    • (2003) Computers & Operations Research , vol.30 , Issue.8 , pp. 1151-1171
    • Kim, Y.1    Park, K.2    Ko, J.3
  • 27
    • 0033166857 scopus 로고    scopus 로고
    • Genetic algorithm for multi-level, multi-machine lot sizing and scheduling
    • Kimms A. Genetic algorithm for multi-level, multi-machine lot sizing and scheduling Computers & Operations Research 26 8 1999 829 848
    • (1999) Computers & Operations Research , vol.26 , Issue.8 , pp. 829-848
    • Kimms, A.1
  • 28
    • 10844287617 scopus 로고    scopus 로고
    • Lagrangian relaxation
    • M. Jünger, D. Naddef, Springer Verlag Heidelberg
    • Lemaréchal C. Lagrangian relaxation M. Jünger, D. Naddef, Computational combinatorial optimization 2001 Springer Verlag Heidelberg 115 160
    • (2001) Computational Combinatorial Optimization , pp. 115-160
    • Lemaréchal, C.1
  • 29
    • 79958772189 scopus 로고    scopus 로고
    • Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
    • Menezes A., Clark A., and Almada-Lobo B. Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups Journal of Scheduling 14 2 2010 209 219
    • (2010) Journal of Scheduling , vol.14 , Issue.2 , pp. 209-219
    • Menezes, A.1    Clark, A.2    Almada-Lobo, B.3
  • 30
    • 0033903519 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
    • Meyr H. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization European Journal of Operational Research 120 2 2000 311 326
    • (2000) European Journal of Operational Research , vol.120 , Issue.2 , pp. 311-326
    • Meyr, H.1
  • 31
    • 0028378737 scopus 로고
    • Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering
    • Millar H., and Yang M. Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering International Journal of Production Economics 34 1 1994 1 15
    • (1994) International Journal of Production Economics , vol.34 , Issue.1 , pp. 1-15
    • Millar, H.1    Yang, M.2
  • 33
    • 0032651376 scopus 로고    scopus 로고
    • The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops
    • Ouenniche J., Boctor F., and Martel A. The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops International Journal Production Research 37 10 1999 2253 2270
    • (1999) International Journal Production Research , vol.37 , Issue.10 , pp. 2253-2270
    • Ouenniche, J.1    Boctor, F.2    Martel, A.3
  • 34
    • 0034500678 scopus 로고    scopus 로고
    • An integrated lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem
    • Ozdamar L., and Barbarosoglu G. An integrated lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem International Journal of Production Economics 68 3 2000 319 331
    • (2000) International Journal of Production Economics , vol.68 , Issue.3 , pp. 319-331
    • Ozdamar, L.1    Barbarosoglu, G.2
  • 36
    • 0030241757 scopus 로고    scopus 로고
    • Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line
    • Sikora R., Chhajed D., and Shaw M. Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line Computers & Industrial Engineering 30 4 1996 659 679
    • (1996) Computers & Industrial Engineering , vol.30 , Issue.4 , pp. 659-679
    • Sikora, R.1    Chhajed, D.2    Shaw, M.3
  • 37
    • 0000857408 scopus 로고    scopus 로고
    • Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times
    • Tempelmeier H., and Derstroff M. Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times Management Science 42 5 1996 738 757
    • (1996) Management Science , vol.42 , Issue.5 , pp. 738-757
    • Tempelmeier, H.1    Derstroff, M.2
  • 38
    • 0022230531 scopus 로고
    • Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation
    • Thizy J.-M., and Van Wassenhove L. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation IIE Transactions 17 4 1985 308 313
    • (1985) IIE Transactions , vol.17 , Issue.4 , pp. 308-313
    • Thizy, J.-M.1    Van Wassenhove, L.2
  • 39
    • 0000555407 scopus 로고
    • Capacitated lot sizing with set-up times
    • Trigeiro W., Thomas L., and McClain J. Capacitated lot sizing with set-up times Management Science 35 3 1989 353 366
    • (1989) Management Science , vol.35 , Issue.3 , pp. 353-366
    • Trigeiro, W.1    Thomas, L.2    McClain, J.3
  • 40
    • 0000495984 scopus 로고
    • Economic lot sizing an o(n log n) algorithm that runs in linear time in the wagner-whitin case
    • Wagelmans A., van Hoesel S., and Kolen A. Economic lot sizing an o(n log n) algorithm that runs in linear time in the wagner-whitin case Operations Research 40 Suppl. 1 1992 S145 S156
    • (1992) Operations Research , vol.40 , pp. S145-S156
    • Wagelmans, A.1    Van Hoesel, S.2    Kolen, A.3
  • 41
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • Wagner H., and Whitin T. Dynamic version of the economic lot size model Management Science 5 1 1958 89 96
    • (1958) Management Science , vol.5 , Issue.1 , pp. 89-96
    • Wagner, H.1    Whitin, T.2


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