메뉴 건너뛰기




Volumn 127, Issue 1, 2000, Pages 126-139

Minimizing maximum lateness with job families

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0037985759     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00328-8     Document Type: Article
Times cited : (25)

References (11)
  • 1
    • 85037519755 scopus 로고    scopus 로고
    • Heuristic procedures for scheduling job families with setups and due dates
    • to appear
    • Baker, K.R., 1997. Heuristic procedures for scheduling job families with setups and due dates. Naval Research Logistics (to appear).
    • (1997) Naval Research Logistics
    • Baker, K.R.1
  • 2
    • 0000612586 scopus 로고
    • Complexity of task sequencing with deadlines, set-up times and changeover costs
    • Bruno, J., Downey, P., 1978. Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM Journal on Computing 7, 393-404.
    • (1978) SIAM Journal on Computing , vol.7 , pp. 393-404
    • Bruno, J.1    Downey, P.2
  • 3
  • 5
    • 0031517374 scopus 로고    scopus 로고
    • Single machine scheduling with batch set-up times to minimize maximum lateness
    • Hariri, A.M.A., Potts, C.N., 1997. Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research 70, 75-92.
    • (1997) Annals of Operations Research , vol.70 , pp. 75-92
    • Hariri, A.M.A.1    Potts, C.N.2
  • 7
    • 84989754383 scopus 로고
    • Minimizing flow time on a single machine with job classes and setup times
    • Mason, A.J., Anderson, E.J., 1991. Minimizing flow time on a single machine with job classes and setup times. Naval Research Logistics 38, 333-350.
    • (1991) Naval Research Logistics , vol.38 , pp. 333-350
    • Mason, A.J.1    Anderson, E.J.2
  • 8
    • 0024736520 scopus 로고
    • On the complexity of scheduling with batch set-up times
    • Monma, C.L., Potts, C.N., 1989. On the complexity of scheduling with batch set-up times. Operations Research 37, 798-804.
    • (1989) Operations Research , vol.37 , pp. 798-804
    • Monma, C.L.1    Potts, C.N.2
  • 9
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
    • Potts, C.N., Van Wassenhove, L.N., 1992. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society 43, 395-406.
    • (1992) Journal of the Operational Research Society , vol.43 , pp. 395-406
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 10
    • 0030215229 scopus 로고    scopus 로고
    • Single-machine scheduling with reselase dates, due dates and family setup times
    • Schutten, J.M.J., van de Velde, S.L., Zijm, W.H.M., 1996. Single-machine scheduling with reselase dates, due dates and family setup times. Management Science 42, 1165-1174.
    • (1996) Management Science , vol.42 , pp. 1165-1174
    • Schutten, J.M.J.1    Van De Velde, S.L.2    Zijm, W.H.M.3
  • 11
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • Webster, S.W., Baker, K.R., 1995. Scheduling groups of jobs on a single machine. Operations Research 43, 692-703.
    • (1995) Operations Research , vol.43 , pp. 692-703
    • Webster, S.W.1    Baker, K.R.2


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