메뉴 건너뛰기




Volumn 239, Issue 3, 2014, Pages 644-662

Modeling lotsizing and scheduling problems with sequence dependent setups

Author keywords

Computational benchmark; Lotsizing and scheduling; Mixed integer programming; Production planning; Sequence dependent setups

Indexed keywords

INTEGER PROGRAMMING; PRODUCTION CONTROL;

EID: 84906224201     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.05.018     Document Type: Article
Times cited : (55)

References (26)
  • 3
    • 84987028582 scopus 로고
    • The prize collecting traveling salesman problem
    • E. Balas The prize collecting traveling salesman problem Networks 19 6 1989 621 636
    • (1989) Networks , vol.19 , Issue.6 , pp. 621-636
    • Balas, E.1
  • 4
    • 0035410522 scopus 로고    scopus 로고
    • Modelling practical lot-sizing problems as mixed-integer programs
    • G. Belvaux, and L.A. Wolsey Modelling practical lot-sizing problems as mixed-integer programs Management Science 47 7 2001 993 1007
    • (2001) Management Science , vol.47 , Issue.7 , pp. 993-1007
    • Belvaux, G.1    Wolsey, L.A.2
  • 6
    • 0034631279 scopus 로고    scopus 로고
    • Rolling-horizon lot-sizing when set-up times are sequence-dependent
    • A.R. Clark, and S.J. Clark Rolling-horizon lot-sizing when set-up times are sequence-dependent International Journal of Production Research 38 10 2000 2287 2307
    • (2000) International Journal of Production Research , vol.38 , Issue.10 , pp. 2287-2307
    • Clark, A.R.1    Clark, S.J.2
  • 8
  • 9
    • 0028769382 scopus 로고
    • The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
    • B. Fleischmann The discrete lot-sizing and scheduling problem with sequence-dependent setup costs European Journal of Operational Research 75 2 1994 395 404
    • (1994) European Journal of Operational Research , vol.75 , Issue.2 , pp. 395-404
    • Fleischmann, B.1
  • 10
    • 0008655177 scopus 로고    scopus 로고
    • The general lotsizing and scheduling problem
    • B. Fleischmann, and H. Meyr 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
  • 12
    • 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
  • 13
    • 0033690423 scopus 로고    scopus 로고
    • Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities
    • K. Haase, and A. Kimms 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
  • 14
    • 79955056703 scopus 로고    scopus 로고
    • Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics
    • R.J. James, and B. Almada-Lobo 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.J.1    Almada-Lobo, B.2
  • 16
    • 0032652235 scopus 로고    scopus 로고
    • Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
    • S. Kang, K. Malik, and L.J. Thomas Lotsizing and scheduling on parallel machines with sequence-dependent setup costs Management Science 45 2 1999 273 289
    • (1999) Management Science , vol.45 , Issue.2 , pp. 273-289
    • Kang, S.1    Malik, K.2    Thomas, L.J.3
  • 17
    • 0002180205 scopus 로고
    • Plant location, set covering and economic lot size: An O(mn) algorithm for structured problems
    • Birkhauser Verlag Berlin
    • J. Krarup, and O. Bilde Plant location, set covering and economic lot size: An O(mn) algorithm for structured problems Optimierung bei Graphentheoretischen und Ganzzahligen Probleme 1977 Birkhauser Verlag Berlin 155 180
    • (1977) Optimierung Bei Graphentheoretischen und Ganzzahligen Probleme , pp. 155-180
    • Krarup, J.1    Bilde, O.2
  • 18
    • 79958772189 scopus 로고    scopus 로고
    • Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
    • A. Menezes, A. Clark, and B. Almada-Lobo Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups Journal of Scheduling 14 2 2011 209 219
    • (2011) Journal of Scheduling , vol.14 , Issue.2 , pp. 209-219
    • Menezes, A.1    Clark, A.2    Almada-Lobo, B.3
  • 19
    • 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 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
  • 20
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling on parallel machines
    • H. Meyr Simultaneous lotsizing and scheduling on parallel machines European Journal of Operational Research 139 2 2002 277 292
    • (2002) European Journal of Operational Research , vol.139 , Issue.2 , pp. 277-292
    • Meyr, H.1
  • 21
    • 53749099938 scopus 로고    scopus 로고
    • A comparative analysis of several asymmetric traveling salesman problem formulations
    • T. Öncan, I.K. Altinel, and G. Laporte A comparative analysis of several asymmetric traveling salesman problem formulations Computers & Operations Research 36 3 2009 637 654
    • (2009) Computers & Operations Research , vol.36 , Issue.3 , pp. 637-654
    • Öncan, T.1    Altinel, I.K.2    Laporte, G.3
  • 23
    • 79952898545 scopus 로고    scopus 로고
    • New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
    • S. Sarin, H. Sherali, and L. Yao New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem Optimization Letters 5 2 2011 259 272
    • (2011) Optimization Letters , vol.5 , Issue.2 , pp. 259-272
    • Sarin, S.1    Sherali, H.2    Yao, L.3
  • 25
    • 0031139978 scopus 로고    scopus 로고
    • MIP modelling of changeovers in production planning and scheduling problems
    • L.A. Wolsey MIP modelling of changeovers in production planning and scheduling problems European Journal of Operational Research 99 1 1997 154 165
    • (1997) European Journal of Operational Research , vol.99 , Issue.1 , pp. 154-165
    • Wolsey, L.A.1
  • 26
    • 33748492325 scopus 로고    scopus 로고
    • Scheduling and lot sizing with sequence-dependent setup: A literature review
    • X. Zhu, and W.E. Wilhelm Scheduling and lot sizing with sequence-dependent setup: A literature review IIE Transactions 38 11 2006 987 1007
    • (2006) IIE Transactions , vol.38 , Issue.11 , pp. 987-1007
    • Zhu, X.1    Wilhelm, W.E.2


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