메뉴 건너뛰기




Volumn 30, Issue 12, 2003, Pages 1777-1789

Scheduling unrelated parallel machines to minimize total weighted tardiness

Author keywords

Branch and bound; Parallel machines; Scheduling; Tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING;

EID: 0042311378     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00105-3     Document Type: Article
Times cited : (121)

References (14)
  • 3
  • 4
    • 0039729391 scopus 로고
    • Minimizing average flow time with parallel machines
    • Horn WA. Minimizing average flow time with parallel machines. Operations Research 1973;21:846-7.
    • (1973) Operations Research , vol.21 , pp. 846-847
    • Horn, W.A.1
  • 5
    • 0032628095 scopus 로고    scopus 로고
    • Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
    • Azizoglu M, Kirca O. Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions 1999;31:153-9.
    • (1999) IIE Transactions , vol.31 , pp. 153-159
    • Azizoglu, M.1    Kirca, O.2
  • 6
    • 0031211263 scopus 로고    scopus 로고
    • Scheduling parallel machines to minimize total weighted and unweighted tardiness
    • Alidaee B, Rosa D. Scheduling parallel machines to minimize total weighted and unweighted tardiness. Computers and Operations Research 1997;24:775-88.
    • (1997) Computers and Operations Research , vol.24 , pp. 775-788
    • Alidaee, B.1    Rosa, D.2
  • 7
    • 0031075568 scopus 로고    scopus 로고
    • Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
    • Koulamas C. Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Research Logistics 1997;44:109-25.
    • (1997) Naval Research Logistics , vol.44 , pp. 109-125
    • Koulamas, C.1
  • 9
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • Kuhn HW. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 1955;1:83-97.
    • (1955) Naval Research Logistics Quarterly , vol.1 , pp. 83-97
    • Kuhn, H.W.1
  • 10
    • 0015991935 scopus 로고
    • Coordinating aggregate and detailed scheduling decisions in the one-machine job shop
    • Gelders L, Kleindorfer PR. Coordinating aggregate and detailed scheduling decisions in the one-machine job shop. Operations Research 1974;22:46-60.
    • (1974) Operations Research , vol.22 , pp. 46-60
    • Gelders, L.1    Kleindorfer, P.R.2
  • 11
    • 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 1969; 17:701-15.
    • (1969) Operations Research , vol.17 , pp. 701-715
    • Emmons, H.1
  • 12
    • 0023341921 scopus 로고
    • A note on weighted tardiness problem
    • Rachamadugu RMV. A note on weighted tardiness problem. Operations Research 1987;35:450-2.
    • (1987) Operations Research , vol.35 , pp. 450-452
    • Rachamadugu, R.M.V.1
  • 13
    • 0033097033 scopus 로고    scopus 로고
    • A new dominance rule for the total weighted tardiness problem
    • Akturk MS, Yildirim MB. A new dominance rule for the total weighted tardiness problem. Production Planning and Control 1999;10:138-49.
    • (1999) Production Planning and Control , vol.10 , pp. 138-149
    • Akturk, M.S.1    Yildirim, M.B.2


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