메뉴 건너뛰기




Volumn 105, Issue 2, 2007, Pages 329-344

Scheduling on a single machine with family setups to minimize total tardiness

Author keywords

Branch and bound; Heuristics; Scheduling; Sequencing

Indexed keywords

HEURISTIC METHODS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; TECHNOLOGY TRANSFER;

EID: 37349049252     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2004.10.020     Document Type: Article
Times cited : (46)

References (14)
  • 1
    • 3543134230 scopus 로고    scopus 로고
    • The single machine batching problem with family setup times t o minimize maximum lateness is strongly NP-hard
    • Cheng T.C.E., Ng C.T., and Yuan J.J. The single machine batching problem with family setup times t o minimize maximum lateness is strongly NP-hard. Journal of Scheduling 6 (2003) 483-490
    • (2003) Journal of Scheduling , vol.6 , pp. 483-490
    • Cheng, T.C.E.1    Ng, C.T.2    Yuan, J.J.3
  • 2
    • 0030125476 scopus 로고    scopus 로고
    • Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
    • Crauwels H.A.J., Potts C.N., and Van Wassenhove L.N. Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs. European Journal of Operational Research 90 (1996) 200-213
    • (1996) European Journal of Operational Research , vol.90 , pp. 200-213
    • Crauwels, H.A.J.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 3
    • 0014535952 scopus 로고
    • One-machine sequencing to minimize certain functions of job tardiness
    • Emmons H. One-machine sequencing to minimize certain functions of job tardiness. Operations Research 17 (1969) 701-715
    • (1969) Operations Research , vol.17 , pp. 701-715
    • Emmons, H.1
  • 4
  • 5
    • 0031517374 scopus 로고    scopus 로고
    • Single machine scheduling with batch set-up times to minimize maximum lateness
    • Hariri A.M.A., and Potts C.N. Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research 70 (1997) 75-92
    • (1997) Annals of Operations Research , vol.70 , pp. 75-92
    • Hariri, A.M.A.1    Potts, C.N.2
  • 6
    • 0027588823 scopus 로고
    • A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
    • Kim Y. A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers & Operations Research 20 (1993) 391-401
    • (1993) Computers & Operations Research , vol.20 , pp. 391-401
    • Kim, Y.1
  • 7
    • 0028550668 scopus 로고
    • The total tardiness problem: Review and extensions
    • Koulamas C. The total tardiness problem: Review and extensions. Operations Research 42 (1994) 1025-1041
    • (1994) Operations Research , vol.42 , pp. 1025-1041
    • Koulamas, C.1
  • 8
    • 0024736520 scopus 로고
    • On the complexity of scheduling with batch setup times
    • Monma C.L., and Potts C.N. On the complexity of scheduling with batch setup times. Operations Research 37 (1989) 798-804
    • (1989) Operations Research , vol.37 , pp. 798-804
    • Monma, C.L.1    Potts, C.N.2
  • 9
    • 84960650840 scopus 로고
    • Group production scheduling for minimum total tardiness part (I)
    • Nakamura N., Yoshida T., and Hitomi K. Group production scheduling for minimum total tardiness part (I). AIIE Transactions (1978) 57-162
    • (1978) AIIE Transactions , pp. 57-162
    • Nakamura, N.1    Yoshida, T.2    Hitomi, K.3
  • 11
    • 0037464639 scopus 로고    scopus 로고
    • Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey
    • Sen T., Sulek J., and Dileepan P. Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey. International Journal of Production Economics 83 (2003) 1-12
    • (2003) International Journal of Production Economics , vol.83 , pp. 1-12
    • Sen, T.1    Sulek, J.2    Dileepan, P.3
  • 13
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • Webster S., and Baker K.R. Scheduling groups of jobs on a single machine. Operations Research 43 (1995) 692-703
    • (1995) Operations Research , vol.43 , pp. 692-703
    • Webster, S.1    Baker, K.R.2
  • 14
    • 0029183195 scopus 로고
    • Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
    • Zdrzalka S. Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times. European Journal of Operational Research 80 (1995) 371-380
    • (1995) European Journal of Operational Research , vol.80 , pp. 371-380
    • Zdrzalka, S.1


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