메뉴 건너뛰기




Volumn 47, Issue 3, 2010, Pages 529-552

Multiple machine continuous setup lotsizing with sequence-dependent setups

Author keywords

Continuous setup lotsizing; Heuristics; Integer programming; Lagrangian decomposition; Sequence dependent setup

Indexed keywords

CAPITAL-INTENSIVE INDUSTRY; COMMON RESOURCES; COMPUTATIONAL EXPERIMENT; FEASIBLE SOLUTION; GLASS CONTAINERS; HEURISTICS; LAGRANGIAN DECOMPOSITION; LOT SIZING; LOT SIZING PROBLEMS; LOWER BOUNDS; MIXED INTEGER PROGRAMMING; MOLDING MACHINES; MULTI-ITEM; MULTIPLE MACHINE; NETWORK FLOWS; OBJECTIVE FUNCTIONS; PRODUCTION LOSS; PRODUCTION PLANNING AND SCHEDULING; REAL LIFE DATA; SEQUENCE DEPENDENT SETUPS; SEQUENCE-DEPENDENT SETUP TIME; VALID INEQUALITY;

EID: 78650068281     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-009-9235-8     Document Type: Article
Times cited : (34)

References (22)
  • 2
    • 45449120446 scopus 로고    scopus 로고
    • Production planning and scheduling in the glass container industry: A VNS approach
    • Almada-Lobo, B., Oliveira, J.F., Carravilla, M.A.: Production planning and scheduling in the glass container industry: A VNS approach. Int. J. Prod. Econ. 114, 363-375 (2008)
    • (2008) Int. J. Prod. Econ. , vol.114 , pp. 363-375
    • Almada-Lobo, B.1    Oliveira, J.F.2    Carravilla, M.A.3
  • 3
    • 34548460398 scopus 로고    scopus 로고
    • Single machine multi-product capacitated lotsizing with sequence-dependent setups
    • Almada-Lobo, B., Klabjan, D., Carravilla, M.A., Oliveira, J.F.: Single machine multi-product capacitated lotsizing with sequence-dependent setups. Int. J. Prod. Res. 45, 4873-4894 (2007)
    • (2007) Int. J. Prod. Res. , vol.45 , pp. 4873-4894
    • Almada-Lobo, B.1    Klabjan, D.2    Carravilla, M.A.3    Oliveira, J.F.4
  • 4
    • 0343270138 scopus 로고    scopus 로고
    • Network optimization: Continuous and discrete models
    • Belmont
    • Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont (1998)
    • (1998) Athena Scientific
    • Bertsekas, D.P.1
  • 5
    • 0034356736 scopus 로고    scopus 로고
    • A polyhedral approach to a production planning problem
    • Constantino, M.: A polyhedral approach to a production planning problem. Ann. Oper. Res. 96, 75-95 (2000)
    • (2000) Ann. Oper. Res. , vol.96 , pp. 75-95
    • Constantino, M.1
  • 6
    • 0028424147 scopus 로고
    • Dynamic production scheduling for a process industry
    • Dematta, R., Guignard, M.: Dynamic production scheduling for a process industry. Oper. Res. 42, 492-503 (1994)
    • (1994) Oper. Res. , vol.42 , pp. 492-503
    • Dematta, R.1    Guignard, M.2
  • 7
    • 0028766168 scopus 로고
    • Studying the effects of production loss due to setup in dynamic production scheduling
    • Dematta, R., Guignard,M.: Studying the effects of production loss due to setup in dynamic production scheduling. Eur. J. Oper. Res. 72, 62-73 (1994)
    • (1994) Eur. J. Oper. Res. , vol.72 , pp. 62-73
    • Dematta, R.1    Guignard, M.2
  • 8
    • 0029392094 scopus 로고
    • The performance of rolling production schedules in a process industry
    • Dematta, R., Guignard, M.: The performance of rolling production schedules in a process industry. IIE Trans. 27, 564-573 (1995)
    • (1995) IIE Trans. , vol.27 , pp. 564-573
    • Dematta, R.1    Guignard, M.2
  • 9
    • 0031170482 scopus 로고    scopus 로고
    • Lot sizing and scheduling-Survey and extensions
    • Drexl, A., Kimms, A.: Lot sizing and scheduling-Survey and extensions. Eur. J. Oper. Res. 99, 221-235 (1997)
    • (1997) Eur. J. Oper. Res. , vol.99 , pp. 221-235
    • Drexl, A.1    Kimms, A.2
  • 10
    • 0028769382 scopus 로고
    • The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
    • Fleischmann, B.: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 75, 395-404 (1994)
    • (1994) Eur. J. Oper. Res. , vol.75 , pp. 395-404
    • Fleischmann, B.1
  • 11
    • 0002554041 scopus 로고
    • Lagrangian relaxation for integer programming
    • Geoffrion, A.M.: Lagrangian relaxation for integer programming. Math. Program. Study 2, 82-114 (1974)
    • (1974) Math. Program. Study , vol.2 , pp. 82-114
    • Geoffrion, A.M.1
  • 12
    • 0016025814 scopus 로고
    • Validation of subgradient optimization
    • Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6, 62-88 (1974)
    • (1974) Math. Program. , vol.6 , pp. 62-88
    • Held, M.1    Wolfe, P.2    Crowder, H.P.3
  • 13
    • 0029389879 scopus 로고
    • Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search
    • Hindi, K.S.: Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search. Comput. Ind. Eng. 28, 701-707 (1995)
    • (1995) Comput. Ind. Eng. , vol.28 , pp. 701-707
    • Hindi, K.S.1
  • 14
    • 0347899318 scopus 로고    scopus 로고
    • An industrial extension of the discrete lot-sizing and scheduling problem
    • Jans, R., Degraeve, Z.: An industrial extension of the discrete lot-sizing and scheduling problem. IIE Trans. 36, 47-58 (2004)
    • (2004) IIE Trans. , vol.36 , pp. 47-58
    • Jans, R.1    Degraeve, Z.2
  • 15
    • 33750728882 scopus 로고    scopus 로고
    • Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
    • Jans, R., Degraeve, Z.: Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. Eur. J. Oper. Res. 177, 1855-1875 (2007)
    • (2007) Eur. J. Oper. Res. , vol.177 , pp. 1855-1875
    • Jans, R.1    Degraeve, Z.2
  • 16
    • 0023342273 scopus 로고
    • The dynamic lot-sizing problem with startup and reservation costs
    • Karmarkar, U.S., Kekre, S., Kekre, S.: The dynamic lot-sizing problem with startup and reservation costs. Oper. Res. 35, 389-398 (1987)
    • (1987) Oper. Res. , vol.35 , pp. 389-398
    • Karmarkar, U.S.1    Kekre, S.2    Kekre, S.3
  • 17
    • 0022022738 scopus 로고
    • The deterministic dynamic product cycling problem
    • Karmarkar, U.S., Schrage, L.: The deterministic dynamic product cycling problem. Oper. Res. 33, 326-345 (1985)
    • (1985) Oper. Res. , vol.33 , pp. 326-345
    • Karmarkar, U.S.1    Schrage, L.2
  • 19
    • 0001532011 scopus 로고    scopus 로고
    • Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows
    • Salomon, M., Solomon, M.M., Van Wassenhove, L.N., Dumas, Y., Dauzere-Peres, S.: Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows. Eur. J. Oper. Res. 100, 494-513 (1997)
    • (1997) Eur. J. Oper. Res. , vol.100 , pp. 494-513
    • Salomon, M.1    Solomon, M.M.2    Van Wassenhove, L.N.3    Dumas, Y.4    Dauzere-Peres, S.5
  • 20
    • 0030241532 scopus 로고    scopus 로고
    • A user interactive heuristic procedure for solving the multiple product cycling problem
    • Sandbothe, R.A.: A user interactive heuristic procedure for solving the multiple product cycling problem. Comput. Oper. Res. 23, 897-907 (1996)
    • (1996) Comput. Oper. Res. , vol.23 , pp. 897-907
    • Sandbothe, R.A.1
  • 21
    • 0032179462 scopus 로고    scopus 로고
    • Lot-sizing with start-up times
    • Vanderbeck, F.: Lot-sizing with start-up times. Manag. Sci. 44, 1409-1425 (1998)
    • (1998) Manag. Sci. , vol.44 , pp. 1409-1425
    • Vanderbeck, F.1
  • 22
    • 0031139978 scopus 로고    scopus 로고
    • MIP modelling of changeovers in production planning and scheduling problems
    • Wolsey, L.A.: MIP modelling of changeovers in production planning and scheduling problems. Eur. J. Oper. Res. 99, 154-165 (1997)
    • (1997) Eur. J. Oper. Res. , vol.99 , pp. 154-165
    • Wolsey, L.A.1


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