메뉴 건너뛰기




Volumn 63, Issue 11, 2012, Pages 1613-1630

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

Author keywords

Lot sizing and scheduling; Mixed integer program; Time scale; Two stage production system

Indexed keywords

CONTINUOUS TIME SYSTEMS; MANUFACTURE; SCHEDULING;

EID: 84867183641     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.159     Document Type: Article
Times cited : (34)

References (21)
  • 3
    • 84855790162 scopus 로고    scopus 로고
    • Synchronisation of scarce resources for a parallel machine lotsizing problem
    • Almeder C and Almada-Lobo B (2011). Synchronisation of scarce resources for a parallel machine lotsizing problem. International Journal of Production Research 49: 7315-7355.
    • (2011) International Journal of Production Research , vol.49 , pp. 7315-7355
    • Almeder, C.1    Almada-Lobo, B.2
  • 7
    • 58149250389 scopus 로고    scopus 로고
    • Solution approaches for the soft drink integrated production lot sizing and scheduling problem
    • Ferreira D, Morabito R and Rangel S (2009). Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research 196: 697-706.
    • (2009) European Journal of Operational Research , vol.196 , pp. 697-706
    • Ferreira, D.1    Morabito, R.2    Rangel, S.3
  • 8
    • 0025384312 scopus 로고
    • The discrete lot sizing and scheduling problem
    • Fleischmann B (1990). The discrete lot sizing and scheduling problem. Management Science 44: 337-348.
    • (1990) Management Science , vol.44 , pp. 337-348
    • Fleischmann, B.1
  • 9
    • 0008655177 scopus 로고    scopus 로고
    • The general lotsizing and scheduling problem
    • Fleischmann B and Meyr H (1997). The general lotsizing and scheduling problem. OR Spectrum 19: 11-21.
    • (1997) OR Spectrum , vol.19 , pp. 11-21
    • Fleischmann, B.1    Meyr, H.2
  • 10
    • 2442583184 scopus 로고    scopus 로고
    • Continuous-time versus discretetime approaches for scheduling of chemical processes: A review
    • Floudas CA and Lin X (2004). Continuous-time versus discretetime approaches for scheduling of chemical processes: A review. Computers & Chemical Engineering 28: 2109-2129.
    • (2004) Computers & Chemical Engineering , vol.28 , pp. 2109-2129
    • Floudas, C.A.1    Lin, X.2
  • 11
    • 0010775487 scopus 로고    scopus 로고
    • Capacitated lot-sizing with sequence dependent setup costs
    • Haase K (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spectrum 18: 51-59.
    • (1996) OR Spectrum , vol.18 , pp. 51-59
    • Haase, K.1
  • 12
    • 67649921386 scopus 로고    scopus 로고
    • Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
    • Jans R (2009). Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. Journal on Computing 21: 123-136.
    • (2009) Journal on Computing , vol.21 , pp. 123-136
    • Jans, R.1
  • 13
    • 0032069649 scopus 로고    scopus 로고
    • Discrete lotsizing and scheduling by batch sequencing
    • Jordan C and Drexl A (1998). Discrete lotsizing and scheduling by batch sequencing. Management Science 44: 698-713.
    • (1998) Management Science , vol.44 , pp. 698-713
    • Jordan, C.1    Drexl, A.2
  • 14
    • 0031186347 scopus 로고    scopus 로고
    • Planning and scheduling of parallel semicontinuous processes. 2. Short-term scheduling
    • Karimi IA and McDonald CM (1997). Planning and scheduling of parallel semicontinuous processes. 2. Short-term scheduling. Industrial & Engineering Chemistry Research 36: 2701-2714.
    • (1997) Industrial & Engineering Chemistry Research , vol.36 , pp. 2701-2714
    • Karimi, I.A.1    McDonald, C.M.2
  • 15
    • 0022022738 scopus 로고
    • The deterministic dynamic product cycling problem
    • Karmarkar US and Schrage L (1985). The deterministic dynamic product cycling problem. Operations Research 33: 326-345.
    • (1985) Operations Research , vol.33 , pp. 326-345
    • Karmarkar, U.S.1    Schrage, L.2
  • 16
    • 69549124012 scopus 로고    scopus 로고
    • Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
    • Kim S, Han J, Lee Y and Park E (2010). Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum. Computers & Operations Research 37: 302-314.
    • (2010) Computers & Operations Research , vol.37 , pp. 302-314
    • Kim, S.1    Han, J.2    Lee, Y.3    Park, E.4
  • 17
    • 0033903519 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
    • Meyr H (2000). Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research 120: 311-326.
    • (2000) European Journal of Operational Research , vol.120 , pp. 311-326
    • Meyr, H.1
  • 18
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling on parallel machines
    • Meyr H (2002). Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research 139: 277-292.
    • (2002) European Journal of Operational Research , vol.139 , pp. 277-292
    • Meyr, H.1
  • 21
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • Wagner H and Whitin T (1958). Dynamic version of the economic lot size model. Management Science 5: 89-96.
    • (1958) Management Science , vol.5 , pp. 89-96
    • Wagner, H.1    Whitin, T.2


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