메뉴 건너뛰기




Volumn 70, Issue 2, 2001, Pages 101-115

Minimizing makespan in a blocking flowshop using genetic algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING; STRATEGIC PLANNING;

EID: 0035277503     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00104-8     Document Type: Article
Times cited : (151)

References (29)
  • 6
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S.M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1 (1954) 61-68.
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 9
    • 0030134958 scopus 로고    scopus 로고
    • A survey of machine scheduling problems with blocking and no-wait in process
    • N.G. Hall, C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations Research 44 (1996) 510-525.
    • (1996) Operations Research , vol.44 , pp. 510-525
    • Hall, N.G.1    Sriskandarajah, C.2
  • 11
    • 0024770469 scopus 로고
    • Sequencing in an assembly line with blocking to minimize cycle time
    • S.T. McCormick, M.L. Pinedo, S. Shenker, B. Wolf, Sequencing in an assembly line with blocking to minimize cycle time, Operations Research 37 (1989) 925-935.
    • (1989) Operations Research , vol.37 , pp. 925-935
    • McCormick, S.T.1    Pinedo, M.L.2    Shenker, S.3    Wolf, B.4
  • 12
    • 0009395081 scopus 로고
    • Ein Beitrag zum Reinhenfolgeproblem
    • J. Piehler, Ein Beitrag zum Reinhenfolgeproblem, Unternehmensforschung 4 (1960) 138-142.
    • (1960) Unternehmensforschung , vol.4 , pp. 138-142
    • Piehler, J.1
  • 14
    • 0000866856 scopus 로고
    • New insertion and postoptimization procedures for the traveling salesman problem
    • M. Gendreau, A. Hertz, G. Laporte, New insertion and postoptimization procedures for the traveling salesman problem, Operations Research 40 (1992) 1086-1094.
    • (1992) Operations Research , vol.40 , pp. 1086-1094
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 15
    • 0028396353 scopus 로고
    • Determining optimal cyclic hoist schedules in a single-hoist electroplating line
    • L. Lei, T.-J. Wang, Determining optimal cyclic hoist schedules in a single-hoist electroplating line, IIE Transactions 26 (1994) 25-33.
    • (1994) IIE Transactions , vol.26 , pp. 25-33
    • Lei, L.1    Wang, T.-J.2
  • 17
  • 18
    • 0025700701 scopus 로고
    • Some efficient heuristic methods for the flowshop sequencing problem
    • E. Taillard, Some efficient heuristic methods for the flowshop sequencing problem, European Journal of Operational Research 47 (1990) 65-74.
    • (1990) European Journal of Operational Research , vol.47 , pp. 65-74
    • Taillard, E.1
  • 21
    • 0000411214 scopus 로고
    • Tabu search - Part I
    • F. Glover, Tabu search - Part I, ORSA Journal on Computing 1 (3) (1989) 190-206.
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 22
    • 0001724713 scopus 로고
    • Tabu search - Part II
    • F. Glover, Tabu search - Part II, ORSA Journal on Computing 2 (1) (1990) 4-32.
    • (1990) ORSA Journal on Computing , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 27
    • 0022559425 scopus 로고
    • Optimization of control parameters for genetic algorithms, IEEE Transactions on Systems
    • J. Grefenstette, Optimization of control parameters for genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics SMC-16(1) (1986).
    • (1986) Man and Cybernetics , vol.SMC-16 , Issue.1
    • Grefenstette, J.1


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