메뉴 건너뛰기




Volumn 34, Issue 5-6, 2007, Pages 584-593

Artificial immune system based approach for solving resource constraint project scheduling problem

Author keywords

Artificial immune system; Hypermutation; Precedence constraint; Project scheduling; Resource constraint

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; LEARNING SYSTEMS; OPTIMIZATION; PLANNING; PRODUCTION; SCHEDULING ALGORITHMS;

EID: 34548267130     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0631-2     Document Type: Article
Times cited : (48)

References (23)
  • 1
    • 15844369427 scopus 로고    scopus 로고
    • Hybrid genetic algorithm with fuzzy logic for resource constrained project scheduling
    • Kim KW, Gen M, Yamajaki G (2003) Hybrid genetic algorithm with fuzzy logic for resource constrained project scheduling. Appl. Soft Comput 2/3F:174-188
    • (2003) Appl. Soft Comput , vol.2 3F , pp. 174-188
    • Kim, K.W.1    Gen, M.2    Yamajaki, G.3
  • 2
    • 0042904338 scopus 로고
    • Resource allocation in project network models a survey
    • Davis EW (1966) Resource allocation in project network models a survey. J Ind Eng 17:177-188
    • (1966) J Ind Eng , vol.17 , pp. 177-188
    • Davis, E.W.1
  • 3
    • 0032042933 scopus 로고    scopus 로고
    • Resource constrained project scheduling - a survey of recent developments
    • Herroelen W. De Reyck B, Demeuiemeester E (1998) Resource constrained project scheduling - a survey of recent developments. Comput Oper Res 25:279-302
    • (1998) Comput Oper Res , vol.25 , pp. 279-302
    • Herroelen, W.1    De Reyck, B.2    Demeuiemeester, E.3
  • 4
    • 0029393209 scopus 로고
    • A survey on the resource-constrained project scheduling problem
    • Ozdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. HE Trans 27:574-586
    • (1995) HE Trans , vol.27 , pp. 574-586
    • Ozdamar, L.1    Ulusoy, G.2
  • 5
    • 0027694317 scopus 로고
    • Heuristics for scheduling projects with resource restrictions and several resource-duration modes
    • Boctor FF (1993) Heuristics for scheduling projects with resource restrictions and several resource-duration modes. Int J Prod Res 31:2547-2558
    • (1993) Int J Prod Res , vol.31 , pp. 2547-2558
    • Boctor, F.F.1
  • 6
    • 0024765468 scopus 로고
    • A bottleneck-based beam search, for job scheduling in a flexible manufacturing system
    • Chang YL, Matsuo H, Sullivan RS (1989) A bottleneck-based beam search, for job scheduling in a flexible manufacturing system. Int J Prod Res 27:1949-1961
    • (1989) Int J Prod Res , vol.27 , pp. 1949-1961
    • Chang, Y.L.1    Matsuo, H.2    Sullivan, R.S.3
  • 7
    • 0030574803 scopus 로고    scopus 로고
    • Modelling setup times, process batches and transfer batches using activity network logic
    • Demeuiemeester EL, Herroelen WS (1996) Modelling setup times, process batches and transfer batches using activity network logic. Eur J OperRes 89:355-365
    • (1996) Eur J OperRes , vol.89 , pp. 355-365
    • Demeuiemeester, E.L.1    Herroelen, W.S.2
  • 8
    • 0031246797 scopus 로고    scopus 로고
    • Distribution requirements and compactness constraints in school time tabling
    • Drexl A, Salewski F(1997) Distribution requirements and compactness constraints in school time tabling, Eur J Oper Res 102:193-214
    • (1997) Eur J Oper Res , vol.102 , pp. 193-214
    • Drexl, A.1    Salewski, F.2
  • 9
    • 0000478729 scopus 로고
    • Solving resource-constrained network problems by implicit enumeration - Non preemptivecase
    • Schrage L (1970) Solving resource-constrained network problems by implicit enumeration - Non preemptivecase. Oper Res 18:263-278
    • (1970) Oper Res , vol.18 , pp. 263-278
    • Schrage, L.1
  • 10
    • 21344485821 scopus 로고
    • Resource-constrained project scheduling: Exact methods for the multi-mode case
    • Springer, Berlin Heidelberg New York
    • Sprecha A (1994) Resource-constrained project scheduling: exact methods for the multi-mode case. Number 409 in lecture notes in economics and mathematical, systems. Springer, Berlin Heidelberg New York.
    • (1994) Number 409 in lecture notes in economics and mathematical, systems
    • Sprecha, A.1
  • 11
    • 0032635871 scopus 로고    scopus 로고
    • A competitive exact algorithm for assembly line balancing
    • Sprecher A (1999) A competitive exact algorithm for assembly line balancing. Int J Prod Res 37:1787-1816
    • (1999) Int J Prod Res , vol.37 , pp. 1787-1816
    • Sprecher, A.1
  • 12
    • 33744922549 scopus 로고
    • Assembly line balancing by resource-constrained project scheduling- acritical appraisal
    • Technical Report 9505, Katholieke Universiteit Leuven, Belgium
    • de Reyck B, Herroelen WS (1995) Assembly line balancing by resource-constrained project scheduling- acritical appraisal. Technical Report 9505, Katholieke Universiteit Leuven, Belgium.
    • (1995)
    • de Reyck, B.1    Herroelen, W.S.2
  • 13
    • 34548272086 scopus 로고    scopus 로고
    • PSPLIB
    • PSPLIB (2000) ftp://ftp.bwl.uni-kiel.de/pub/operation.sresearch/ psplib/HTML/
    • (2000)
  • 14
    • 0036613006 scopus 로고    scopus 로고
    • Learning and optimization using the clonal selection principle. IEEETrans Evolutionary computation
    • De Castero LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEETrans Evolutionary computation, Special Issue on Artif Immune Syst 6(3):239-251
    • (2002) Special Issue on Artif Immune Syst , vol.6 , Issue.3 , pp. 239-251
    • De Castero, L.N.1    Von Zuben, F.J.2
  • 15
    • 0242269931 scopus 로고    scopus 로고
    • Solving the assembly configuration problem for modular products using an immune algorithm approach
    • Khoo LP, Situmdrang TD (2003) Solving the assembly configuration problem for modular products using an immune algorithm approach. Int J Prod. Res 41(15):3419-3434
    • (2003) Int J Prod. Res , vol.41 , Issue.15 , pp. 3419-3434
    • Khoo, L.P.1    Situmdrang, T.D.2
  • 16
    • 0001188971 scopus 로고
    • Genetic algorithm for combinatorial optimisation: Assembly line balancing problem
    • Anderson EJ, Ferris MC (1994) Genetic algorithm for combinatorial optimisation: assembly line balancing problem. ORSA J Comput 6:161-173
    • (1994) ORSA J Comput , vol.6 , pp. 161-173
    • Anderson, E.J.1    Ferris, M.C.2
  • 17
    • 0003131416 scopus 로고    scopus 로고
    • Tabu-search algorithms and lower bounds for the resource constrained project scheduling problem
    • Voss et al, eds, KIuwer, Dordrecht
    • Baar T, Brucker P, Knust S (1999) Tabu-search algorithms and lower bounds for the resource constrained project scheduling problem. In: Voss et al. (eds.) Meta-heuristics, KIuwer, Dordrecht, pages 1-8
    • (1999) Meta-heuristics , pp. 1-8
    • Baar, T.1    Brucker, P.2    Knust, S.3
  • 18
    • 34548285838 scopus 로고    scopus 로고
    • Bouleimen K, Lecocq H (1998) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem. Technical report, Universit' e de Li' ege, Belgium
    • Bouleimen K, Lecocq H (1998) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem. Technical report, Universit' e de Li' ege, Belgium
  • 19
    • 0032188522 scopus 로고    scopus 로고
    • A competitive genetic algorithm for resource-constrained project scheduling
    • Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. NavRes Logist 45:733-750
    • (1998) NavRes Logist , vol.45 , pp. 733-750
    • Hartmann, S.1
  • 20
    • 33845274958 scopus 로고
    • Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
    • Leon VJ, Ramamoorthy B (1995) Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling. OR Spektrum 17:173-182
    • (1995) OR Spektrum , vol.17 , pp. 173-182
    • Leon, V.J.1    Ramamoorthy, B.2
  • 21
    • 0001896880 scopus 로고    scopus 로고
    • Adaptive search, for solving hard project scheduling problems
    • Kolisch R, Drexl A (1996) Adaptive search, for solving hard project scheduling problems. Nav Res Logist 43:23-40
    • (1996) Nav Res Logist , vol.43 , pp. 23-40
    • Kolisch, R.1    Drexl, A.2
  • 22
    • 0030121479 scopus 로고    scopus 로고
    • Serial, and parallel resource-constrained project scheduling methods revisited: Theory and computation
    • Kolisch R (1996) Serial, and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur J Opa Res 90:320-333
    • (1996) Eur J Opa Res , vol.90 , pp. 320-333
    • Kolisch, R.1
  • 23
    • 0000103290 scopus 로고    scopus 로고
    • Case-based reasoning and improved adaptive search for project scheduling
    • Schirmer A. (2000) Case-based reasoning and improved adaptive search for project scheduling. Nav Res Logist 47: 201-222
    • (2000) Nav Res Logist , vol.47 , pp. 201-222
    • Schirmer, A.1


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