메뉴 건너뛰기




Volumn 12, Issue 4, 2001, Pages 335-344

Constructive and improvement flow shop scheduling heuristics: An extensive evaluation

Author keywords

Flowshop scheduling; Genetic algorithm; Heuristics

Indexed keywords

BENCHMARKING; DECISION MAKING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; RESOURCE ALLOCATION;

EID: 0035384296     PISSN: 09537287     EISSN: None     Source Type: Journal    
DOI: 10.1080/09537280152004950     Document Type: Article
Times cited : (47)

References (26)
  • 2
    • 34249754216 scopus 로고
    • A generalized permutation approach to job shop scheduling with genetic algorithm
    • Bierwirth, C., 1995, A generalized permutation approach to job shop scheduling with genetic algorithm. OR Spectrum, 17, 87-92.
    • (1995) OR Spectrum , vol.17 , pp. 87-92
    • Bierwirth, C.1
  • 3
    • 0014807274 scopus 로고
    • A heuristic algorithm for the 'N' job 'M' machine sequencing problem
    • Campbell, H.G., Dudek, R.A., and Smith, M.L., 1970, A heuristic algorithm for the 'N' job 'M' machine sequencing problem. Management Science, 16, 630-637.
    • (1970) Management Science , vol.16 , pp. 630-637
    • Campbell, H.G.1    Dudek, R.A.2    Smith, M.L.3
  • 5
    • 0029207545 scopus 로고
    • Theory and methodology-an application of genetic algorithms for flow shop problems
    • Chen, C.-L., Vempati, V.S., and Aljaber, N., 1995, Theory and methodology-an application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80, 389-396.
    • (1995) European Journal of Operational Research , vol.80 , pp. 389-396
    • Chen, C.-L.1    Vempati, V.S.2    Aljaber, N.3
  • 6
    • 0017516618 scopus 로고
    • An evaluation of flow shop sequencing heuristics
    • Dannenbring, D.G., 1977, An evaluation of flow shop sequencing heuristics. Management Science, 23, 1174-1182.
    • (1977) Management Science , vol.23 , pp. 1174-1182
    • Dannenbring, D.G.1
  • 12
    • 0015033601 scopus 로고
    • A functional heuristic algorithm for the flow shop scheduling problem
    • Gupta, J., 1971, A functional heuristic algorithm for the flow shop scheduling problem. Operations Research Quarterly, 22, 289-303.
    • (1971) Operations Research Quarterly , vol.22 , pp. 289-303
    • Gupta, J.1
  • 14
    • 0003075019 scopus 로고
    • Optimal two and three-stage production schedules with set-up times included
    • Johnson, S.M., 1954, Optimal two and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61-68.
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 17
    • 0020699921 scopus 로고
    • A heuristic algorithm for the 'M' machine, 'N' job flow shop sequencing problem
    • Nawaz, M., Enscore Jr., E.E., and Ham, I., 1983, A heuristic algorithm for the 'M' machine, 'N' job flow shop sequencing problem. OMEGA, 11, 91-95.
    • (1983) OMEGA , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore E.E., Jr.2    Ham, I.3
  • 18
    • 0001393583 scopus 로고
    • Sequencing jobs through a multi stage process in the minimum total time-a quick method of obtaining a near optimum
    • Palmer, D.S., 1965, Sequencing jobs through a multi stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Ouarterly, 16, 101-107.
    • (1965) Operational Research Ouarterly , vol.16 , pp. 101-107
    • Palmer, D.S.1
  • 19
    • 0000577905 scopus 로고
    • General local search heuristics in combinatorial optimisation: A tutorial
    • Pirlot, M., 1992, General local search heuristics in combinatorial optimisation: a tutorial. Belgium Journal of Operations Research, 32, 8-67.
    • (1992) Belgium Journal of Operations Research , vol.32 , pp. 8-67
    • Pirlot, M.1
  • 21
    • 0001040519 scopus 로고
    • A heuristic for scheduling on flow shop and flow line based manufacturing cell with multi criteria
    • Rajendran, C., 1994, A heuristic for scheduling on flow shop and flow line based manufacturing cell with multi criteria. International Journal of Production Research, 32, 2541-2558.
    • (1994) International Journal of Production Research , vol.32 , pp. 2541-2558
    • Rajendran, C.1
  • 22
    • 0031234631 scopus 로고    scopus 로고
    • Heuristics for scheduling in a flow shop with set-up, processing and removal times separated
    • Rajendran, C., and Zeigler, H., 1997, Heuristics for scheduling in a flow shop with set-up, processing and removal times separated. Production Planning & Control, 8, 568-576.
    • (1997) Production Planning & Control , vol.8 , pp. 568-576
    • Rajendran, C.1    Zeigler, H.2
  • 23
    • 0030243899 scopus 로고    scopus 로고
    • An evaluation of sequencing heuristics in flow shops with multiple processors
    • Santos, D.L., Hunsucker, J.L., and Deal, D.E., 1996, An evaluation of sequencing heuristics in flow shops with multiple processors. Computers and Industrial Engineering, 30, 681-692.
    • (1996) Computers and Industrial Engineering , vol.30 , pp. 681-692
    • Santos, D.L.1    Hunsucker, J.L.2    Deal, D.E.3
  • 24
    • 0030408054 scopus 로고    scopus 로고
    • Formulation and heuristics for scheduling in a buffer-constrained flow shop and flow line-based manufacturing cell with different buffer space requirements for jobs: Part I
    • Sharada Priyadarshini, B., and Rajendran, C., 1996, Formulation and heuristics for scheduling in a buffer-constrained flow shop and flow line-based manufacturing cell with different buffer space requirements for jobs: Part I. International Journal of Production Research, 34, 3465-3483.
    • (1996) International Journal of Production Research , vol.34 , pp. 3465-3483
    • Sharada Priyadarshini, B.1    Rajendran, C.2
  • 26
    • 0024700013 scopus 로고
    • Theory and methodology-a new heuristic method for the flow shop sequencing problem
    • Widmer, M., and Hertz, A., 1989, Theory and methodology-a new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41, 186-193.
    • (1989) European Journal of Operational Research , vol.41 , pp. 186-193
    • Widmer, M.1    Hertz, A.2


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