메뉴 건너뛰기
Operations Research
Volumn 47, Issue 4, 1999, Pages 559-569
Changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; FLEXIBLE MANUFACTURING SYSTEMS; PROBLEM SOLVING; PROCESS CONTROL; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;
EID: 0032594180     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.4.559     Document Type: Article
Times cited : (9)
References (12)
  • 1
    • 0021472079 scopus 로고    scopus 로고
    • A survey on forward methods in mathematical programming
    • Aronson, J. E., G. L. Thompson. A survey on forward methods in mathematical programming. Large Scale Systems 7 1-16.
    • Large Scale Systems , vol.7 , pp. 1-16
    • Aronson, J.E.1    Thompson, G.L.2
  • 2
    • 0030287710 scopus 로고    scopus 로고
    • An improved lower bound for the changeover scheduling problem
    • Blocher, J. D., S. Chand. 1996a. An improved lower bound for the changeover scheduling problem. IIE Trans. 28 901-909.
    • (1996) IIE Trans. , vol.28 , pp. 901-909
    • Blocher, J.D.1    Chand, S.2
  • 3
    • 0030171487 scopus 로고    scopus 로고
    • A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
    • _, _. 1996b. A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. European J. Oper. Res. 91 456-470.
    • (1996) European J. Oper. Res. , vol.91 , pp. 456-470
  • 4
    • 0000612586 scopus 로고
    • Complexity of task sequencing with deadlines, set-up times, and changeover costs
    • Bruno, J., P. Downey. 1978. Complexity of task sequencing with deadlines, set-up times, and changeover costs. SIAM J. Comput. 7 393-404.
    • (1978) SIAM J. Comput. , vol.7 , pp. 393-404
    • Bruno, J.1    Downey, P.2
  • 5
    • 0027582974 scopus 로고
    • A dual ascent and column generation heuristic for the discrete lot-sizing and scheduling problem with setup times
    • Cattrysse, D., M. Salomon, R. Kuik, L. N. VanWassenhove. 1993. A dual ascent and column generation heuristic for the discrete lot-sizing and scheduling problem with setup times. Management Sci. 39 477-486.
    • (1993) Management Sci. , vol.39 , pp. 477-486
    • Cattrysse, D.1    Salomon, M.2    Kuik, R.3    Vanwassenhove, L.N.4
  • 6
    • 0017682606 scopus 로고
    • Scheduling production on one machine with changeover costs
    • Driscoll, W. C., H. Emmons. 1977. Scheduling production on one machine with changeover costs. AIIE Trans. 9 388-395.
    • (1977) AIIE Trans. , vol.9 , pp. 388-395
    • Driscoll, W.C.1    Emmons, H.2
  • 8
    • 0000949843 scopus 로고
    • Minimum change-over scheduling of several products on one machine
    • Glassey, C. R. 1968. Minimum change-over scheduling of several products on one machine. Oper. Res. 16 342-352.
    • (1968) Oper. Res. , vol.16 , pp. 342-352
    • Glassey, C.R.1
  • 9
    • 0025434528 scopus 로고
    • A strong cutting plane algorithm for production scheduling with changeover costs
    • Magnanti, T. L., R. Vachani. 1990. A strong cutting plane algorithm for production scheduling with changeover costs. Oper. Res. 38 456-473.
    • (1990) Oper. Res. , vol.38 , pp. 456-473
    • Magnanti, T.L.1    Vachani, R.2
  • 10
    • 0015400859 scopus 로고
    • Optimum production scheduling of multicommodity in flow line
    • Mitsumori, S. 1972. Optimum production scheduling of multicommodity in flow line. IEEE Trans. SMC 2 486-493.
    • (1972) IEEE Trans. SMC , vol.2 , pp. 486-493
    • Mitsumori, S.1
  • 11
    • 0019582070 scopus 로고
    • Optimum scheduling for load balance of two-machine production lines
    • _. 1981. Optimum scheduling for load balance of two-machine production lines. IEEE Trans.-SMC 11 400-409.
    • (1981) IEEE Trans.-SMC , vol.11 , pp. 400-409
  • 12
    • 0010353276 scopus 로고
    • Forward algorithms for forward thinking managers
    • Morton, T. E. 1981. Forward algorithms for forward thinking managers. Appl. Management Sci. 1 1-55.
    • (1981) Appl. Management Sci. , vol.1 , pp. 1-55
    • Morton, T.E.1

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