메뉴 건너뛰기




Volumn 55, Issue 2, 1998, Pages 163-168

Tardiness minimization on parallel machines

Author keywords

Branch and bound; Parallel machines; Scheduling; Total tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION;

EID: 0032117209     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(98)00034-6     Document Type: Article
Times cited : (90)

References (11)
  • 1
    • 0001207278 scopus 로고
    • Scheduling with deadlines and loss functions on k parallel machines
    • J.G. Root, Scheduling with deadlines and loss functions on k parallel machines, Management Science 14 (1965) 460-475.
    • (1965) Management Science , vol.14 , pp. 460-475
    • Root, J.G.1
  • 2
    • 0018685640 scopus 로고
    • Evaluation of a heuristic for scheduling independent jobs on parallel identical processors
    • A. Dogramaci, J. Surkis, Evaluation of a heuristic for scheduling independent jobs on parallel identical processors, Management Science 25 (1979) 1208-1216.
    • (1979) Management Science , vol.25 , pp. 1208-1216
    • Dogramaci, A.1    Surkis, J.2
  • 3
    • 84989675202 scopus 로고
    • Heuristics for minimizing mean tardiness for m parallel machines
    • J.C. Ho, Y. Chang, Heuristics for minimizing mean tardiness for m parallel machines, Naval Research Logistics 38 (1991) 367-381.
    • (1991) Naval Research Logistics , vol.38 , pp. 367-381
    • Ho, J.C.1    Chang, Y.2
  • 4
    • 0002349523 scopus 로고
    • Weighted tardiness problem on parallel machines with proportional weights
    • E.M. Arkin, O.R. Roundy, Weighted tardiness problem on parallel machines with proportional weights, Operations Research 39 (1991) 64-81.
    • (1991) Operations Research , vol.39 , pp. 64-81
    • Arkin, E.M.1    Roundy, O.R.2
  • 5
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-Hard
    • J. Du, J.Y.T. Leung, Minimizing total tardiness on one machine is NP-Hard, Mathematics of Operations Research 15 (1990) 483-495.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 8
    • 0028392196 scopus 로고
    • A note on the minimization of flowtimes on parallel machines
    • T.C.E. Cheng, J.E. Diamond, A note on the minimization of flowtimes on parallel machines, IIE Transactions 26 (1994) 109-111.
    • (1994) IIE Transactions , vol.26 , pp. 109-111
    • Cheng, T.C.E.1    Diamond, J.E.2
  • 10
    • 0017240964 scopus 로고
    • A dual algorithm for the one machine scheduling problem
    • M.L. Fisher, A dual algorithm for the one machine scheduling problem, Mathematical Programming 11 (1976) 229-251.
    • (1976) Mathematical Programming , vol.11 , pp. 229-251
    • Fisher, M.L.1
  • 11
    • 0016943203 scopus 로고
    • And approximate algorithms for scheduling nonidentical processors
    • E. Horowitz, S. Sahni, Exact and approximate algorithms for scheduling nonidentical processors, Journal of ACM 23 (1976) 317-327.
    • (1976) Journal of ACM , vol.23 , pp. 317-327
    • Horowitz, E.1    S Sahni, E.2


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