메뉴 건너뛰기




Volumn 167, Issue 3, 2005, Pages 772-795

A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

Author keywords

Flowshop scheduling; Makespan; Multiple objectives; Simulated annealing; Total flowtime

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC METHODS; JOB ANALYSIS; OPERATIONS RESEARCH; PROBABILITY DENSITY FUNCTION; SIMULATED ANNEALING;

EID: 13544263208     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.07.020     Document Type: Article
Times cited : (162)

References (32)
  • 3
    • 0014807274 scopus 로고
    • A heuristic algorithm for the n-job, m-machine sequencing problem
    • H.G. Campbell, R.A. Dudek, and M.L. Smith 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
  • 4
    • 0037063773 scopus 로고    scopus 로고
    • The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem
    • P.-C. Chang, J.-C. Hsieh, and S.G. Lin The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem International Journal of Production Economics 79 2002 171 183
    • (2002) International Journal of Production Economics , vol.79 , pp. 171-183
    • Chang, P.-C.1    Hsieh, J.-C.2    Lin, S.G.3
  • 6
    • 0037120618 scopus 로고    scopus 로고
    • Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
    • J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation European Journal of Operational Research 141 2002 559 569
    • (2002) European Journal of Operational Research , vol.141 , pp. 559-569
    • Framinan, J.M.1    Leisten, R.2    Ruiz-Usano, R.3
  • 7
    • 50749136055 scopus 로고
    • A simulated annealing heuristic for scheduling in a flowshop with bicriteria
    • R. Gangadharan, and C. Rajendran A simulated annealing heuristic for scheduling in a flowshop with bicriteria Computers & Industrial Engineering 27 1994 473 476
    • (1994) Computers & Industrial Engineering , vol.27 , pp. 473-476
    • Gangadharan, R.1    Rajendran, C.2
  • 9
    • 0029264383 scopus 로고
    • Flowshop sequencing with mean flow time objective
    • J.C. Ho Flowshop sequencing with mean flow time 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
    • 0000177367 scopus 로고
    • Application of the branch-and-bound technique to some scheduling problems
    • E. Ignall, and L. Schrage Application of the branch-and-bound technique to some scheduling problems Operations Research 13 1965 400 412
    • (1965) Operations Research , vol.13 , pp. 400-412
    • Ignall, E.1    Schrage, L.2
  • 11
  • 13
    • 0003075019 scopus 로고
    • Optimal two and three-stage production schedules with set-up times included
    • S.M. Johnson Optimal two and three-stage production schedules with set-up times included Naval Research Logistics Quarterly 1 1954 61 68
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 14
    • 0035898985 scopus 로고    scopus 로고
    • Constructive and composite heuristic solutions to the P//∑Ci scheduling problem
    • J. Liu, and C.R. Reeves Constructive and composite heuristic solutions to the P / / ∑ C i scheduling problem European Journal of Operational Research 132 2001 439 452
    • (2001) European Journal of Operational Research , vol.132 , pp. 439-452
    • Liu, J.1    Reeves, C.R.2
  • 17
    • 0030241820 scopus 로고    scopus 로고
    • Multi-objective genetic algorithm and its applications to flowshop scheduling
    • T. Murata, H. Ishibuchi, and H. Tanaka Multi-objective genetic algorithm and its applications to flowshop scheduling Computers & Industrial Engineering 130 1996 957 968
    • (1996) Computers & Industrial Engineering , vol.130 , pp. 957-968
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 19
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flowshop sequencing problem
    • M. Nawaz, E.E. Enscore Jr., and I. Ham 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 Jr., E.E.2    Ham, I.3
  • 20
    • 0032043112 scopus 로고    scopus 로고
    • Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline based manufacturing cell
    • S. Parthasarathy, and C. Rajendran Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline based manufacturing cell Computers & Industrial Engineering 34 1998 531 546
    • (1998) Computers & Industrial Engineering , vol.34 , pp. 531-546
    • Parthasarathy, S.1    Rajendran, C.2
  • 21
    • 0027542699 scopus 로고
    • Heuristic algorithm for scheduling in a flowshop to minimize total flowtime
    • C. Rajendran 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
  • 22
    • 0029635352 scopus 로고
    • Heuristics for scheduling in flowshop with multiple objectives
    • C. Rajendran 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
  • 23
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2004 426 438
    • (2004) European Journal of Operational Research , vol.155 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2
  • 24
    • 0030192321 scopus 로고    scopus 로고
    • Scheduling in flowshop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach
    • J. Sridhar, and C. Rajendran Scheduling in flowshop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach Production Planning & Control 7 1996 374 382
    • (1996) Production Planning & Control , vol.7 , pp. 374-382
    • Sridhar, J.1    Rajendran, C.2
  • 25
    • 0000852513 scopus 로고
    • Multiobjective optimization using nondominated sorting in genetic algorithms
    • N. Srinivas, and K. Deb Multiobjective optimization using nondominated sorting in genetic algorithms Evolutionary Computation 2 1995 221 248
    • (1995) Evolutionary Computation , vol.2 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 28
  • 31
    • 0024700013 scopus 로고
    • A new heuristic method for the flowshop sequencing problem
    • M. Widmer, and A. Hertz A new heuristic method for the flowshop sequencing problem European Journal of Operational Research 41 1989 186 193
    • (1989) European Journal of Operational Research , vol.41 , pp. 186-193
    • Widmer, M.1    Hertz, A.2
  • 32
    • 0032017163 scopus 로고    scopus 로고
    • A heuristic algorithm for mean flowtime objective in flowshop scheduling
    • H.S. Woo, and D.S. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers & Operations Research 25 1998 175 182
    • (1998) Computers & Operations Research , vol.25 , pp. 175-182
    • Woo, H.S.1    Yim, D.S.2


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