메뉴 건너뛰기




Volumn 31, Issue 13, 2004, Pages 2279-2289

Minimizing the total weighted flow time in a single machine with controllable processing times

Author keywords

Dynamic programming; Heuristics; Optimization; Resource allocation; Single machine scheduling; Weighted flow time

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MACHINE COMPONENTS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

EID: 2942731249     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00187-4     Document Type: Article
Times cited : (74)

References (15)
  • 1
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • Smith W.E. Various optimizers for single-stage production Naval Research Logistics Quarterly 3 1956 59-66
    • (1956) Naval Research Logistics Quarterly , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 3
    • 0023518955 scopus 로고
    • One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
    • Janiak A. One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints Kybernetika 23 1987 289-293
    • (1987) Kybernetika , vol.23 , pp. 289-293
    • Janiak, A.1
  • 4
    • 0024769314 scopus 로고
    • Single machine scheduling with controllable processing times and number of jobs tardy
    • Daniels R.L. Sarin R.K. Single machine scheduling with controllable processing times and number of jobs tardy Operations Research 37 1989 981-984
    • (1989) Operations Research , vol.37 , pp. 981-984
    • Daniels, R.L.1    Sarin, R.K.2
  • 5
    • 0025478981 scopus 로고
    • A multi-objective approach to resource allocation in single machine scheduling
    • Daniels R.L. A multi-objective approach to resource allocation in single machine scheduling European Journal of Operational Research 48 1990 226-241
    • (1990) European Journal of Operational Research , vol.48 , pp. 226-241
    • Daniels, R.L.1
  • 6
    • 0030263104 scopus 로고    scopus 로고
    • Single machine scheduling subject to deadlines and resource dependent processing times
    • Janiak A. Kovalyov M.Y. Single machine scheduling subject to deadlines and resource dependent processing times European Journal of Operational Research 94 1996 284-291
    • (1996) European Journal of Operational Research , vol.94 , pp. 284-291
    • Janiak, A.1    Kovalyov, M.Y.2
  • 7
    • 0032222091 scopus 로고    scopus 로고
    • Bicriterion single machine scheduling with resource dependent processing times
    • Cheng T.C.E. Janiak A. Kovalyov M.Y. Bicriterion single machine scheduling with resource dependent processing times SIAM Journal on Optimization 8 1998 617-630
    • (1998) SIAM Journal on Optimization , vol.8 , pp. 617-630
    • Cheng, T.C.E.1    Janiak, A.2    Kovalyov, M.Y.3
  • 10
    • 0141640100 scopus 로고
    • Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions
    • Monma C.L. Schrijver A. Todd M.J. Wei V.K. Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions Mathematics of Operations Research 15 1990 736-748
    • (1990) Mathematics of Operations Research , vol.15 , pp. 736-748
    • Monma, C.L.1    Schrijver, A.2    Todd, M.J.3    Wei, V.K.4
  • 12
    • 0029219182 scopus 로고
    • An O(N log(1/ε)) algorithm for the two-resource allocation problem with a non-differentiable convex objective function
    • Armstrong R. Gu S. Lei L. An O(N log(1/ε)) algorithm for the two-resource allocation problem with a non-differentiable convex objective function Journal of the Operational Research Society 46 1995 116-122
    • (1995) Journal of the Operational Research Society , vol.46 , pp. 116-122
    • Armstrong, R.1    Gu, S.2    Lei, L.3
  • 13
    • 0031199114 scopus 로고    scopus 로고
    • Solving a class of two-resource allocation problem by equivalent load method
    • Armstrong R. Gu S. Lei L. Solving a class of two-resource allocation problem by equivalent load method Journal of the Operational Research Society 48 1997 818-825
    • (1997) Journal of the Operational Research Society , vol.48 , pp. 818-825
    • Armstrong, R.1    Gu, S.2    Lei, L.3
  • 14
    • 0019055358 scopus 로고
    • Two single-machine sequencing problems involving controllable job processing times
    • Vickson R.G. Two single-machine sequencing problems involving controllable job processing times AIIE Transactions 12 3 1980 258-262
    • (1980) AIIE Transactions , vol.12 , Issue.3 , pp. 258-262
    • Vickson, R.G.1
  • 15
    • 0036096594 scopus 로고    scopus 로고
    • Some comments on sequencing with controllable processing times
    • Hoogeveen H. Woeginger G.J. Some comments on sequencing with controllable processing times Computing 68 2002 181-192
    • (2002) Computing , vol.68 , pp. 181-192
    • Hoogeveen, H.1    Woeginger, G.J.2


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