메뉴 건너뛰기




Volumn 32, Issue 11, 2005, Pages 2751-2770

Two-machine flowshop scheduling with job class setups to minimize total flowtime

Author keywords

Branch and bound algorithms; Flowshop scheduling; Heuristics; Job class setups; Total flowtime

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; JOB ANALYSIS; POLYNOMIALS;

EID: 13844280440     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.04.002     Document Type: Article
Times cited : (17)

References (16)
  • 1
    • 0021579865 scopus 로고
    • Optimal schedules for single facility with two job classes
    • Gupta J.N.D. Optimal schedules for single facility with two job classes. Computers & Operations Research. 11:1984;409-413
    • (1984) Computers & Operations Research , vol.11 , pp. 409-413
    • Gupta, J.N.D.1
  • 2
    • 0025857797 scopus 로고
    • Scheduling two job classes on a single machine
    • Potts C.N. Scheduling two job classes on a single machine. Computers & Operations Research. 18:1991;411-415
    • (1991) Computers & Operations Research , vol.18 , pp. 411-415
    • Potts, C.N.1
  • 5
    • 84989754383 scopus 로고
    • Minimizing flow time on a single machine with job classes and setup times
    • Mason A.J., Anderson E.J. Minimizing flow time on a single machine with job classes and setup times. Naval Research Logistics. 38:1991;333-350
    • (1991) Naval Research Logistics , vol.38 , pp. 333-350
    • Mason, A.J.1    Anderson, E.J.2
  • 6
    • 0032343614 scopus 로고    scopus 로고
    • Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
    • Crauwels H.A.J., Hariri A.M.A., Potts C.N., Van Wassenhove L.N. Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time. Annals of Operations Research. 83:1998;59-76
    • (1998) Annals of Operations Research , vol.83 , pp. 59-76
    • Crauwels, H.A.J.1    Hariri, A.M.A.2    Potts, C.N.3    Van Wassenhove, L.N.4
  • 7
    • 0042043056 scopus 로고    scopus 로고
    • Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
    • Crauwels H.A.J., Potts C.N., Van Wassenhove L.N. Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time. Annals of Operations Research. 70:1997;261-279
    • (1997) Annals of Operations Research , vol.70 , pp. 261-279
    • Crauwels, H.A.J.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 8
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
    • Potts C.N., Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society. 43:1992;395-406
    • (1992) Journal of the Operational Research Society , vol.43 , pp. 395-406
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 9
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • Webster S., Baker K.R. Scheduling groups of jobs on a single machine. Operations Research. 43:1995;692-704
    • (1995) Operations Research , vol.43 , pp. 692-704
    • Webster, S.1    Baker, K.R.2
  • 12
    • 0017918132 scopus 로고
    • Flowshop and job shop schedules: Complexity and approximation
    • Gonzalez T., Sahni S. Flowshop and job shop schedules. complexity and approximation Operations Research. 26:1978;36-52
    • (1978) Operations Research , vol.26 , pp. 36-52
    • Gonzalez, T.1    Sahni, S.2
  • 13
    • 0032017163 scopus 로고    scopus 로고
    • A heuristic algorithm for mean flowtime objective in flowshop scheduling
    • Woo H.-S., Yim D.-S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research. 25:1998;175-182
    • (1998) Computers & Operations Research , vol.25 , pp. 175-182
    • Woo, H.-S.1    Yim, D.-S.2
  • 15
    • 0034141527 scopus 로고    scopus 로고
    • Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times
    • Allahverdi A. Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times. Computers & Operations Research. 27:2000;111-127
    • (2000) Computers & Operations Research , vol.27 , pp. 111-127
    • Allahverdi, A.1


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