메뉴 건너뛰기




Volumn 23, Issue 7, 1996, Pages 641-651

An iterative heuristic for the single machine dynamic total completion time scheduling problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMICS; HEURISTIC METHODS; ITERATIVE METHODS; JOB ANALYSIS; MACHINERY; OPERATIONS RESEARCH; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0030191604     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00071-2     Document Type: Article
Times cited : (19)

References (14)
  • 1
    • 0345901561 scopus 로고
    • Sequencing and scheduling: Algorithms and complexity
    • (Edited by S. C. Graves. A. H. G. Rinnooy Kan, P. H. Zipkin) North Holland
    • E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Sequencing and scheduling: algorithms and complexity. In Handbooks in Operations Research and Management Science Vol. 4, (Edited by S. C. Graves. A. H. G. Rinnooy Kan, P. H. Zipkin) North Holland, 445-522 (1993).
    • (1993) Handbooks in Operations Research and Management Science , vol.4 , pp. 445-522
    • Lawler, E.L.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3    Shmoys, D.B.4
  • 3
    • 3342943539 scopus 로고
    • Implementation of a decision support system for scheduling semiconductor testing operations
    • C. Y. Lee, L. A. Martin-Vega, R. Uzsoy and J. Hinchman, Implementation of a decision support system for scheduling semiconductor testing operations. J. Electronics Manufacturing 3, 121-131 (1993).
    • (1993) J. Electronics Manufacturing , vol.3 , pp. 121-131
    • Lee, C.Y.1    Martin-Vega, L.A.2    Uzsoy, R.3    Hinchman, J.4
  • 4
    • 0001761492 scopus 로고
    • Scheduling of a single machine to minimize total weighted completion time subject to release dates
    • L. Bianco and S. Ricciardelli, Scheduling of a single machine to minimize total weighted completion time subject to release dates. Naval Res. Logist. Q. 29, 151-167 (1982).
    • (1982) Naval Res. Logist. Q. , vol.29 , pp. 151-167
    • Bianco, L.1    Ricciardelli, S.2
  • 5
    • 0019342692 scopus 로고
    • An algorithm for single machine sequencing with release dates to minimize total weighted completion time
    • A. M. A. Hariri and C. H. Potts, An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics 5, 99-109 (1983).
    • (1983) Discrete Applied Mathematics , vol.5 , pp. 99-109
    • Hariri, A.M.A.1    Potts, C.H.2
  • 6
    • 84989726654 scopus 로고
    • A branch and bound algorithm to minimize total flow time with unequal release dates
    • C. Chu, A branch and bound algorithm to minimize total flow time with unequal release dates. Naval Res. Logist. 39, 859-875 (1992).
    • (1992) Naval Res. Logist. , vol.39 , pp. 859-875
    • Chu, C.1
  • 7
    • 84873001125 scopus 로고    scopus 로고
    • Single-machine scheduling with dynamic arrivals: Decomposition results and a forward algorithm
    • in press
    • S. Chand, R. Traub and R. Uzsoy, Single-machine scheduling with dynamic arrivals: decomposition results and a forward algorithm. Naval Res. Logist., in press.
    • Naval Res. Logist.
    • Chand, S.1    Traub, R.2    Uzsoy, R.3
  • 8
    • 0001662666 scopus 로고
    • Analysis of a heuristic for one machine sequencing with release dates and delivery times
    • Potts, C. N., Analysis of a heuristic for one machine sequencing with release dates and delivery times. Opns. Res. 28, 1436-1441 (1980).
    • (1980) Opns. Res. , vol.28 , pp. 1436-1441
    • Potts, C.N.1
  • 9
    • 0000934433 scopus 로고
    • On n/1/F dynamic deterministic problems
    • R. Chandra, On n/1/F dynamic deterministic problems. Naval Res. Logist. Q. 26, 537-544 (1979).
    • (1979) Naval Res. Logist. Q. , vol.26 , pp. 537-544
    • Chandra, R.1
  • 10
    • 0000736963 scopus 로고
    • Sequencing jobs with unequal ready times to minimize mean flow time
    • M.I. Dessouky and J.S. Deogun, Sequencing jobs with unequal ready times to minimize mean flow time. SIAM J. Computing 10, 192-202 (1981).
    • (1981) SIAM J. Computing , vol.10 , pp. 192-202
    • Dessouky, M.I.1    Deogun, J.S.2
  • 11
    • 38249010591 scopus 로고
    • Efficient heuristics to minimize total flow time with release dates
    • C. Chu, Efficient heuristics to minimize total flow time with release dates. Opns. Res. Lett. 12, 321-330 (1992).
    • (1992) Opns. Res. Lett. , vol.12 , pp. 321-330
    • Chu, C.1
  • 13
    • 0024072003 scopus 로고
    • The deadline constrained weighted completion time problem: Analysis of a heuristic
    • M. Posner, The deadline constrained weighted completion time problem: analysis of a heuristic. Opns. Res. 36, 742-746 (1988).
    • (1988) Opns. Res. , vol.36 , pp. 742-746
    • Posner, M.1
  • 14
    • 0022066843 scopus 로고
    • Probabilistic analysis of a machine scheduling problem
    • P.G. Gazmuri, Probabilistic analysis of a machine scheduling problem. Math. Opns. Res. 10, 328-339 (1985).
    • (1985) Math. Opns. Res. , vol.10 , pp. 328-339
    • Gazmuri, P.G.1


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