메뉴 건너뛰기




Volumn 32, Issue 11, 2005, Pages 2987-3005

Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs

Author keywords

Changeover cost; Multiple capacitated resources; Scheduling; Sequence dependent setup

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; COSTS; INJECTION MOLDING; NOZZLES; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

EID: 13844298234     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.04.012     Document Type: Article
Times cited : (59)

References (39)
  • 2
    • 85191109290 scopus 로고    scopus 로고
    • Machine scheduling
    • Aarts E, Lenstra J, editors NJ: Princeton University Press
    • Anderson E, Glass C, Poots C. Machine scheduling. In: Aarts E, Lenstra J, editors. Local Search in Combinatorial Optimization, vol. 11. NJ: Princeton University Press; 1997. p. 361-414.
    • (1997) Local Search in Combinatorial Optimization , vol.11 , pp. 361-414
    • Anderson, E.1    Glass, C.2    Poots, C.3
  • 3
    • 0034073578 scopus 로고    scopus 로고
    • Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacited lot sizing problem
    • Barbarosoglu G.Ô, zdamar L. Analysis of solution space-dependent performance of simulated annealing. the case of the multi-level capacited lot sizing problem Computers and Operations Research. 27(9):2000;895-903
    • (2000) Computers and Operations Research , vol.27 , Issue.9 , pp. 895-903
    • Barbarosoglu, G.Ô.1    Zdamar, L.2
  • 4
    • 0023343841 scopus 로고
    • Determining lot sizes and resource requirements, a review
    • Bahl H., Ritzman L., Gupta J. Determining lot sizes and resource requirements, a review. Operations Research. 35(3):1987;329-345
    • (1987) Operations Research , vol.35 , Issue.3 , pp. 329-345
    • Bahl, H.1    Ritzman, L.2    Gupta, J.3
  • 5
    • 0033700686 scopus 로고    scopus 로고
    • BC-PROD: A specialized branch-and-cut system for lot-sizing problems
    • Belvaux G., Wolsey L.A. BC-PROD. a specialized branch-and-cut system for lot-sizing problems Management Science. 46:2000;724-738
    • (2000) Management Science , vol.46 , pp. 724-738
    • Belvaux, G.1    Wolsey, L.A.2
  • 6
    • 0020832935 scopus 로고
    • Mathematical approaches to capacity constrained MRP systems: Review, formulation and problem reduction
    • Billington P., McClain J., Thomas L. Mathematical approaches to capacity constrained MRP systems. review, formulation and problem reduction Management Science. 29(2):1983;1126-1141
    • (1983) Management Science , vol.29 , Issue.2 , pp. 1126-1141
    • Billington, P.1    McClain, J.2    Thomas, L.3
  • 7
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • Bitran G.R., Yanasse H.H. Computational complexity of the capacitated lot size problem. Management Science. 28(10):1982;1174-1186
    • (1982) Management Science , vol.28 , Issue.10 , pp. 1174-1186
    • Bitran, G.R.1    Yanasse, H.H.2
  • 8
    • 0019913634 scopus 로고
    • Improved heuristics for multi-stage requirements planning systems
    • Blackburn J., Millen R. Improved heuristics for multi-stage requirements planning systems. Management Science. 28(1):1982;44-56
    • (1982) Management Science , vol.28 , Issue.1 , pp. 44-56
    • Blackburn, J.1    Millen, R.2
  • 9
    • 0034631279 scopus 로고    scopus 로고
    • Rolling horizon lot-sizing when setup times are sequence dependent
    • Clark A.R., Clark S.J. Rolling horizon lot-sizing when setup 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
  • 10
    • 13844250893 scopus 로고    scopus 로고
    • A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with setup times
    • Erasmus Research Institute of Management (ERIM)
    • Degraeve Z, Jans R. A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with setup times. Discussion Paper, Erasmus Research Institute of Management (ERIM), 2003. p. 285.
    • (2003) Discussion Paper , pp. 285
    • Degraeve, Z.1    Jans, R.2
  • 11
    • 0001226544 scopus 로고
    • A Lagrangean relaxation approach for very large scale capacitated lot-sizing
    • Diaby M., Bahl H.C., Karwan M.H., Zionts S. A Lagrangean relaxation approach for very large scale capacitated lot-sizing. Management Science. 38(9):1992;1329-1339
    • (1992) Management Science , vol.38 , Issue.9 , pp. 1329-1339
    • Diaby, M.1    Bahl, H.C.2    Karwan, M.H.3    Zionts, S.4
  • 12
    • 33749286452 scopus 로고
    • A heuristic solution procedure for multi-item, single-level, limited capacity lot-sizing problem
    • Dixon P., Silver E. A heuristic solution procedure for multi-item, single-level, limited capacity lot-sizing problem. Journal of Operational Management. 2:1981;23-39
    • (1981) Journal of Operational Management , vol.2 , pp. 23-39
    • Dixon, P.1    Silver, E.2
  • 13
  • 14
    • 0030087385 scopus 로고    scopus 로고
    • Sequential analysis based randomized-regret-methods for lot-sizing and scheduling
    • Drexl A., Haase K. Sequential analysis based randomized-regret-methods for lot-sizing and scheduling. Journal of the Operational Research Society. 47(2):1996;251-265
    • (1996) Journal of the Operational Research Society , vol.47 , Issue.2 , pp. 251-265
    • Drexl, A.1    Haase, K.2
  • 16
    • 0023456043 scopus 로고
    • Solving multi-item capacitated lot-sizing problems using variable redefinition
    • Eppen G.D., Martin R.K. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research. 35(6):1987;832-848
    • (1987) Operations Research , vol.35 , Issue.6 , pp. 832-848
    • Eppen, G.D.1    Martin, R.K.2
  • 17
    • 0008655177 scopus 로고    scopus 로고
    • The general lot-sizing and scheduling problem
    • Fleischmann B., Meyr H. The general lot-sizing 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
  • 18
    • 0019032810 scopus 로고
    • Deterministic production planning: Algorithms and complexity
    • Florian M., Lenstra J.K., Rinnooy Kan H.G. Deterministic production planning. algorithms and complexity Management Science. 26(7):1980;669-679
    • (1980) Management Science , vol.26 , Issue.7 , pp. 669-679
    • Florian, M.1    Lenstra, J.K.2    Rinnooy Kan, H.G.3
  • 20
    • 0029775454 scopus 로고    scopus 로고
    • Lot-sizing in serial assembly systems with multiple constrained resources
    • Harrison T., Lewis H. Lot-sizing in serial assembly systems with multiple constrained resources. Management Science. 42(1):1996;19-36
    • (1996) Management Science , vol.42 , Issue.1 , pp. 19-36
    • Harrison, T.1    Lewis, H.2
  • 21
    • 0003066666 scopus 로고
    • Multi-stage lot-sizing for general production systems
    • Axsater S, Schneeweiss C, Silver E, editors Heidelberg, Germany: Springer Verlag
    • Heinrich C, Schneeweiss C. Multi-stage lot-sizing for general production systems. In: Axsater S, Schneeweiss C, Silver E, editors. Lecture Notes in Economics and Mathematical Systems, vol. 266. Heidelberg, Germany: Springer Verlag; 1986. p. 150-81.
    • (1986) Lecture Notes in Economics and Mathematical Systems , vol.266 , pp. 150-181
    • Heinrich, C.1    Schneeweiss, C.2
  • 22
    • 0005252817 scopus 로고
    • Lot sizing in capacitated production planning and control systems
    • Helber S. Lot sizing in capacitated production planning and control systems. OR Spektrum. 17:1995;5-18
    • (1995) OR Spektrum , vol.17 , pp. 5-18
    • Helber, S.1
  • 23
    • 0032069649 scopus 로고    scopus 로고
    • Discrete lot-sizing and scheduling by batch sequencing
    • Jordan C., Drexl A. Discrete lot-sizing and scheduling by batch sequencing. Management Science. 44:1998;698-713
    • (1998) Management Science , vol.44 , pp. 698-713
    • Jordan, C.1    Drexl, A.2
  • 24
    • 0032093820 scopus 로고    scopus 로고
    • Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
    • Katok E., Lewis H.S., Harrison T.P. Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Management Science. 44(6):1998;859-877
    • (1998) Management Science , vol.44 , Issue.6 , pp. 859-877
    • Katok, E.1    Lewis, H.S.2    Harrison, T.P.3
  • 25
    • 0027348258 scopus 로고
    • Linear programming, simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems
    • Kuik R., Salomon M., Van Wassenhove L.N., Maes J. Linear programming, simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems. IIE Transactions. 25(1):1993;62-72
    • (1993) IIE Transactions , vol.25 , Issue.1 , pp. 62-72
    • Kuik, R.1    Salomon, M.2    Van Wassenhove, L.N.3    Maes, J.4
  • 27
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lot-sizing and scheduling on parallel machines
    • Meyr H. Simultaneous lot-sizing and scheduling on parallel machines. European Journal of Operational Research. 139(2):2001;277-292
    • (2001) European Journal of Operational Research , vol.139 , Issue.2 , pp. 277-292
    • Meyr, H.1
  • 28
    • 28244462073 scopus 로고    scopus 로고
    • A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
    • Miller A., Nemhauser G., Savelsbergh M. A multi-item production planning model with setup times. algorithms, reformulations, and polyhedral characterizations for a special case Mathematical Programming. 5(1):2003;71-90
    • (2003) Mathematical Programming , vol.5 , Issue.1 , pp. 71-90
    • Miller, A.1    Nemhauser, G.2    Savelsbergh, M.3
  • 29
    • 13844250892 scopus 로고    scopus 로고
    • On the polyhedral structure of a multiitem production planning model with setup times
    • Miller A., Nemhauser G., Savelsbergh M. On the polyhedral structure of a multiitem production planning model with setup times. Mathematical Programming. 94:2003;375-405
    • (2003) Mathematical Programming , vol.94 , pp. 375-405
    • Miller, A.1    Nemhauser, G.2    Savelsbergh, M.3
  • 30
    • 0025814466 scopus 로고
    • Solving multi-item lot-sizing problems using strong cutting planes
    • Pochet Y., Wolsey L.A. Solving multi-item lot-sizing problems using strong cutting planes. Management Science. 37(1):1991;53-67
    • (1991) Management Science , vol.37 , Issue.1 , pp. 53-67
    • Pochet, Y.1    Wolsey, L.A.2
  • 31
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
    • Potts C., Van Wassenhove L. Integrating scheduling with batching and lot-sizing. a review of algorithms and complexity Operational Research Society. 43(5):1992;395-406
    • (1992) Operational Research Society , vol.43 , Issue.5 , pp. 395-406
    • Potts, C.1    Van Wassenhove, L.2
  • 33
    • 0003361539 scopus 로고
    • Deterministic lot-sizing models for production planning
    • Heidelberg, Germany: Springer Verlag
    • Salomon M. Deterministic lot-sizing models for production planning. Lecture Notes in Economics and Mathematical Systems, Heidelberg, Germany: Springer Verlag; 1991. p. 355.
    • (1991) Lecture Notes in Economics and Mathematical Systems , pp. 355
    • Salomon, M.1
  • 34
    • 0025701546 scopus 로고
    • Multi-level lot sizing problem: Evaluation of a simulated annealing heuristic
    • Salomon M., Kuik R. Multi-level lot sizing problem. evaluation of a simulated annealing heuristic European Journal of Operational Research. 45(1):1990;25-37
    • (1990) European Journal of Operational Research , vol.45 , Issue.1 , pp. 25-37
    • Salomon, M.1    Kuik, R.2
  • 35
    • 0141733592 scopus 로고    scopus 로고
    • Multi-level lot-sizing with setup times and multiple resource constrained resources: Internally rolling schedules with lot-sizing windows
    • Stadtler H. Multi-level lot-sizing with setup times and multiple resource constrained resources. internally rolling schedules with lot-sizing windows Operations Research. 51(3):2003;487-502
    • (2003) Operations Research , vol.51 , Issue.3 , pp. 487-502
    • Stadtler, H.1
  • 36
    • 0028769370 scopus 로고
    • A heuristic for multi-item multi-level capacitated lot-sizing for general product structure
    • Tempelmeier H., Helber S. A heuristic for multi-item multi-level capacitated lot-sizing for general product structure. European Journal of Operational Research. 75(2):1994;296-311
    • (1994) European Journal of Operational Research , vol.75 , Issue.2 , pp. 296-311
    • Tempelmeier, H.1    Helber, S.2
  • 37
    • 0000857408 scopus 로고    scopus 로고
    • A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times
    • Tempelmeier H., Derstroff M. A 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
  • 39
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • Wagner H.M., Within T.H. 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.M.1    Within, T.H.2


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