메뉴 건너뛰기




Volumn 141, Issue 3, 2002, Pages 559-569

Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation

Author keywords

Bi criteria problems; Flowshop; Heuristic; Scheduling; Sequencing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DECISION MAKING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

EID: 0037120618     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00278-8     Document Type: Article
Times cited : (106)

References (29)
  • 1
    • 56449107505 scopus 로고
    • OR-library: Distributing test problems by electronic mail
    • Beasley J.E. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society. 41:1990;1069-1072.
    • (1990) Journal of the Operational Research Society , vol.41 , pp. 1069-1072
    • Beasley, J.E.1
  • 2
    • 0014807274 scopus 로고
    • A heuristic algorithm for the n-job, m-machine sequencing problem
    • Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the. n -job, m -machine sequencing problem Management Science. 16:1970;B630-B637.
    • (1970) Management Science , vol.16
    • Campbell, H.G.1    Dudek, R.A.2    Smith, M.L.3
  • 3
    • 0017516618 scopus 로고
    • An evaluation of flowshop sequence heuristics
    • Dannenbring D.G. An evaluation of flowshop sequence heuristics. Management Science. 23:1977;1174-1182.
    • (1977) Management Science , vol.23 , pp. 1174-1182
    • Dannenbring, D.G.1
  • 4
    • 0013007318 scopus 로고    scopus 로고
    • Bicriterion static scheduling research for a single machine
    • Dileepan P., Sen T. Bicriterion static scheduling research for a single machine. OMEGA. 16:1998;39-53.
    • (1998) OMEGA , vol.16 , pp. 39-53
    • Dileepan, P.1    Sen, T.2
  • 5
    • 0001322778 scopus 로고    scopus 로고
    • A survey and annotated bibliography of multiobjective combinatorial optimization
    • Ehrgott M., Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum. 22:2000;425-460.
    • (2000) OR Spektrum , vol.22 , pp. 425-460
    • Ehrgott, M.1    Gandibleux, X.2
  • 7
    • 0015316023 scopus 로고
    • Heuristic algorithms for multistage flowshop scheduling problem
    • Gupta J.N.D. Heuristic algorithms for multistage flowshop scheduling problem. AIIE Transactions. 4:1972;11-18.
    • (1972) AIIE Transactions , vol.4 , pp. 11-18
    • Gupta, J.N.D.1
  • 8
    • 0015124833 scopus 로고
    • An optimality criterion for flowshop schedules
    • Gupta J.N.D., Dudek R.A. An optimality criterion for flowshop schedules. AIIE Transactions. 3:1971;199-205.
    • (1971) AIIE Transactions , vol.3 , pp. 199-205
    • Gupta, J.N.D.1    Dudek, R.A.2
  • 9
    • 0029264383 scopus 로고
    • Flowshop sequencing with mean flowtime objective
    • Ho J.C. Flowshop sequencing with mean flowtime objective. European Journal of Operational Research. 81:1995;571-578.
    • (1995) European Journal of Operational Research , vol.81 , pp. 571-578
    • Ho, J.C.1
  • 10
    • 0027146758 scopus 로고
    • Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling
    • MacCarthy B.L., Liu J. Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling. International Journal of Production Research. 31:1993;59-79.
    • (1993) International Journal of Production Research , vol.31 , pp. 59-79
    • MacCarthy, B.L.1    Liu, J.2
  • 13
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flowshop sequencing problem
    • Nawaz M., Enscore E.E., Ham I. A heuristic algorithm for the. m -machine, n -job flowshop sequencing problem OMEGA. 11:1983;91-95.
    • (1983) OMEGA , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.E.2    Ham, I.3
  • 14
    • 0001393583 scopus 로고
    • Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum
    • Palmer D.S. Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum. Operational Research Quarterly. 16:1965;101-107.
    • (1965) Operational Research Quarterly , vol.16 , pp. 101-107
    • Palmer, D.S.1
  • 16
    • 0027542699 scopus 로고
    • Heuristic algorithm for scheduling in a flowshop to minimize total flowtime
    • Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics. 29:1993;65-73.
    • (1993) International Journal of Production Economics , vol.29 , pp. 65-73
    • Rajendran, C.1
  • 17
    • 0001040519 scopus 로고
    • A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
    • Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research. 32:1994;2541-2558.
    • (1994) International Journal of Production Research , vol.32 , pp. 2541-2558
    • Rajendran, C.1
  • 18
    • 0029635352 scopus 로고
    • Heuristics for scheduling in flowshop with multiple objectives
    • Rajendran C. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research. 82:1995;540-555.
    • (1995) European Journal of Operational Research , vol.82 , pp. 540-555
    • Rajendran, C.1
  • 19
    • 0026925262 scopus 로고
    • An efficient heuristic approach to the scheduling of jobs in a flowshop
    • Rajendran C., Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research. 61:1991;318-325.
    • (1991) European Journal of Operational Research , vol.61 , pp. 318-325
    • Rajendran, C.1    Chaudhuri, D.2
  • 21
    • 0033102018 scopus 로고    scopus 로고
    • A bicriteria approach to the two-machine flow shop scheduling problem
    • Sayin S., Karabati S. A bicriteria approach to the two-machine flow shop scheduling problem. European Journal of Operational Research. 113:1999;435-449.
    • (1999) European Journal of Operational Research , vol.113 , pp. 435-449
    • Sayin, S.1    Karabati, S.2
  • 22
    • 0022905665 scopus 로고
    • An integer goal programming formulation of a flow shop scheduling problem
    • Selen W.J., Hott D.D. An integer goal programming formulation of a flow shop scheduling problem. Journal of the Operational Research Society. 37:1986;1121-1128.
    • (1986) Journal of the Operational Research Society , vol.37 , pp. 1121-1128
    • Selen, W.J.1    Hott, D.D.2
  • 24
    • 0030192321 scopus 로고    scopus 로고
    • Scheduling in flowshop and cellular manufacturing systems with multiple objectives - A genetic algorithmic approach
    • Sridhar J., Rajendran C. Scheduling in flowshop and cellular manufacturing systems with multiple objectives - a genetic algorithmic approach. Production Planning and Control. 7:1996;374-382.
    • (1996) Production Planning and Control , vol.7 , pp. 374-382
    • Sridhar, J.1    Rajendran, C.2
  • 25
    • 0025700701 scopus 로고
    • Some efficient methods for the flow shop sequencing problem
    • Taillard E. Some efficient methods for the flow shop 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
  • 27
    • 0002976163 scopus 로고
    • Comparison of heuristics for flowshop sequencing
    • Turner S., Booth D. Comparison of heuristics for flowshop sequencing. OMEGA. 15:1987;75-85.
    • (1987) OMEGA , vol.15 , pp. 75-85
    • Turner, S.1    Booth, D.2
  • 28
    • 84974875749 scopus 로고
    • Alternative formulation of a flow shop scheduling problem
    • Wilson J.M. Alternative formulation of a flow shop scheduling problem. Journal of the Operational Research Society. 40:1989;395-399.
    • (1989) Journal of the Operational Research Society , vol.40 , pp. 395-399
    • Wilson, J.M.1
  • 29
    • 0032017163 scopus 로고    scopus 로고
    • A heuristic algorithm for mean flowtime objective in flowshop scheduling
    • Woo D.S., Yim H.S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research. 25:1998;175-182.
    • (1998) Computers and Operations Research , vol.25 , pp. 175-182
    • Woo, D.S.1    Yim, H.S.2


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