메뉴 건너뛰기




Volumn 29, Issue 1, 2001, Pages 41-47

A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times

Author keywords

Approximation algorithm; Quadratic programming; Scheduling with controllable processing times

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROCESS CONTROL; PRODUCTION CONTROL; QUADRATIC PROGRAMMING; RELAXATION PROCESSES; SCHEDULING; THEOREM PROVING;

EID: 0035426177     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00080-3     Document Type: Article
Times cited : (16)

References (16)
  • 14
    • 0028383503 scopus 로고
    • Scheduling multiple variable-speed machines
    • (1994) Oper. Res. , vol.42 , pp. 234-248
    • Trick, M.1
  • 15
    • 0019058538 scopus 로고
    • Choosing the job sequence and processing times to minimize total processing plus flow cost on single machine
    • (1980) Oper. Res. , vol.28 , pp. 1155-1167
    • Vickson, R.G.1


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