메뉴 건너뛰기




Volumn 31, Issue 8, 2004, Pages 1273-1301

A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling

Author keywords

Heuristics; Local search algorithms; Project management; Project scheduling; Scheduling

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COSTS; HEURISTIC METHODS; LINEAR PROGRAMMING; OPTIMIZATION; PLANNING; PROJECT MANAGEMENT; RESOURCE ALLOCATION; SCHEDULING; SUBROUTINES;

EID: 1642398260     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00080-7     Document Type: Article
Times cited : (28)

References (22)
  • 1
    • 1642399483 scopus 로고    scopus 로고
    • 4D CAD and dynamic resource planning for specialist contractors: Case study and issues
    • Issa R, Flood I, O'Brien W, editors. The Netherlands: Swets - Zeitlinger, Lisse, in press
    • O'Brien WJ. 4D CAD and dynamic resource planning for specialist contractors: Aase study and issues. In: Issa R, Flood I, O'Brien W, editors. Developments and applications: The visual construction enterprise. The Netherlands: Swets - Zeitlinger, Lisse, 2002. 21p. in press.
    • (2002) Developments and Applications: The Visual Construction Enterprise , pp. 21
    • O'Brien, W.J.1
  • 3
    • 0345901561 scopus 로고
    • Sequencing and scheduling: Algorithms and complexity. Ch 9
    • Graves SC, Rinnooy Kan AHG, Zipkin PH, editors. Logistics of production and inventory. Amsterdam: North-Holland
    • Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: Algorithms and complexity. Ch 9. In: Graves SC, Rinnooy Kan AHG, Zipkin PH, editors. Handbooks in operations research and management science, vol. 4, Logistics of production and inventory. Amsterdam: North-Holland, 1993. p. 445-522.
    • (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
  • 6
    • 77957077792 scopus 로고
    • A 'Pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness
    • Lawler E.L. A 'Pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness Annals of Discrete Mathematics 1 1977 331-342
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 7
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • Du J. Leung J.Y.-.T. Minimizing total tardiness on one machine is NP-hard Mathematical Operational Research 15 1990 483-495
    • (1990) Mathematical Operational Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.-T.2
  • 10
    • 0005764899 scopus 로고
    • An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis
    • Harvey R.T. Patterson J.H. An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis Foundations of Control Engineering 4 1979 107-117
    • (1979) Foundations of Control Engineering , vol.4 , pp. 107-117
    • Harvey, R.T.1    Patterson, J.H.2
  • 11
    • 0018444440 scopus 로고
    • A dynamic programming algorithm for decision CPM networks
    • Hindelang T.J. Muth J.F. A dynamic programming algorithm for decision CPM networks Operational Research 27 1979 225-241
    • (1979) Operational Research , vol.27 , pp. 225-241
    • Hindelang, T.J.1    Muth, J.F.2
  • 13
    • 0025478981 scopus 로고
    • Multi-objective approach to resource allocation in single machine scheduling
    • Daniels R.L. Multi-objective approach to resource allocation in single machine scheduling European Journal of Operational Research 48 2 1990 226-241
    • (1990) European Journal of Operational Research , vol.48 , Issue.2 , pp. 226-241
    • Daniels, R.L.1
  • 18
    • 0028510982 scopus 로고
    • A greedy randomized adaptive search procedure for maximum independent set
    • Feo T.A. Resende M.G.C. Smith S.H. A greedy randomized adaptive search procedure for maximum independent set Operational Research 42 5 1994 860-878
    • (1994) Operational Research , vol.42 , Issue.5 , pp. 860-878
    • Feo, T.A.1    Resende, M.G.C.2    Smith, S.H.3
  • 21
    • 0001267667 scopus 로고
    • Structure of a simple scheduling polyhedron
    • Queyranne M. Structure of a simple scheduling polyhedron Mathematical Progress 58 1993 263-285
    • (1993) Mathematical Progress , vol.58 , pp. 263-285
    • Queyranne, M.1


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