메뉴 건너뛰기




Volumn 64, Issue 1, 2000, Pages 101-111

Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; PROCESS CONTROL; SCHEDULING;

EID: 0033906893     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00048-1     Document Type: Article
Times cited : (108)

References (17)
  • 4
    • 0014807274 scopus 로고
    • A heuristic algorithm for the n -job, m -machine sequencing problem
    • Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the. n -job, m -machine sequencing problem Management Science. 16:1970;B630-B637.
    • (1970) Management Science , vol.16
    • Campbell, H.G.1    Dudek, R.A.2    Smith, M.L.3
  • 5
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m -machine, n -job flowshop sequencing problem
    • Nawaz M., Enscore E., Ham I. A heuristic algorithm for the. m -machine, n -job flowshop sequencing problem Omega. 11:1983;91-95.
    • (1983) Omega , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.2    Ham, I.3
  • 6
    • 0017516618 scopus 로고
    • An evaluation of flowshop sequencing heuristics
    • Dannenbring D.G. An evaluation of flowshop sequencing heuristics. Management Science. 23(11):1977;1174-1182.
    • (1977) Management Science , vol.23 , Issue.11 , pp. 1174-1182
    • Dannenbring, D.G.1
  • 7
    • 0017494957 scopus 로고
    • Sequencing n -jobs on m -machines to minimize maximum tardiness: A branch-and-bound solution
    • Townsend W. Sequencing. n -jobs on m -machines to minimize maximum tardiness A branch-and-bound solution Management Science. 23:1977;1016-1019.
    • (1977) Management Science , vol.23 , pp. 1016-1019
    • Townsend, W.1
  • 8
    • 0020736891 scopus 로고
    • Flowshop problems with time lags
    • Szwarc W. Flowshop problems with time lags. Management Science. 29:1983;477-481.
    • (1983) Management Science , vol.29 , pp. 477-481
    • Szwarc, W.1
  • 12
    • 0030170411 scopus 로고    scopus 로고
    • Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
    • Guinet A., Solomon M. Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. International Journal of Production Research. 34(6):1996;1643-1654.
    • (1996) International Journal of Production Research , vol.34 , Issue.6 , pp. 1643-1654
    • Guinet, A.1    Solomon, M.2
  • 13
    • 0027146758 scopus 로고
    • Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling
    • Maccarthy B.L., Liu J. Addressing the gap in scheduling research. A review of optimization and heuristic methods in production scheduling International Journal of Production Research. 31(1):1993;59-79.
    • (1993) International Journal of Production Research , vol.31 , Issue.1 , pp. 59-79
    • Maccarthy, B.L.1    Liu, J.2
  • 14
    • 0002983799 scopus 로고    scopus 로고
    • Integrated and sequential approaches to schedule hybrid flowshop in make-to-stock environment
    • Belgium: Mons
    • Guinet A. Integrated and sequential approaches to schedule hybrid flowshop in make-to-stock environment. Proceedings of the Workshop on Production Planning and Control. 1996;299-302 Mons, Belgium.
    • (1996) Proceedings of the Workshop on Production Planning and Control , pp. 299-302
    • Guinet, A.1
  • 16
    • 0001326653 scopus 로고
    • Scheduling a two-stage hybrid flowshop with separable setup and removal times
    • Gupta J.N.D., Tunc E.A. Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research. 77:1994;415-428.
    • (1994) European Journal of Operational Research , vol.77 , pp. 415-428
    • Gupta, J.N.D.1    Tunc, E.A.2


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