메뉴 건너뛰기




Volumn 1, Issue 4, 2007, Pages 391-413

Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times

Author keywords

B B; bi criteria scheduling; branch and bound; cellular manufacturing; flowshop; lower bound; makespan; MOGA; multi objective genetic algorithm; pareto optimal frontier; sequence dependent setups; total flow time

Indexed keywords


EID: 84969451571     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/ejie.2007.015388     Document Type: Article
Times cited : (26)

References (22)
  • 1
    • 0346462895 scopus 로고    scopus 로고
    • A new heuristic for m-machine flowshop-scheduling problem with bicriteria of makespan and maximum tardiness
    • Allahverdi, A. (2004) ‘A new heuristic for m-machine flowshop-scheduling problem with bicriteria of makespan and maximum tardiness’, Computer and Operation Research, Vol. 31, No. 2, pp.157–180.
    • (2004) Computer and Operation Research , vol.31 , Issue.2 , pp. 157-180
    • Allahverdi, A.1
  • 5
    • 14644435008 scopus 로고    scopus 로고
    • Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups
    • Franca, P.M., Gupta, J.N.D., Mendes, A.S., Moscato, P. and Veltink, K.J. (2005) ‘Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups’, Computer and Industrial Engineering, Vol. 48, No. 3, pp.1–16.
    • (2005) Computer and Industrial Engineering , vol.48 , Issue.3 , pp. 1-16
    • Franca, P.M.1    Gupta, J.N.D.2    Mendes, A.S.3    Moscato, P.4    Veltink, K.J.5
  • 7
    • 31444449761 scopus 로고    scopus 로고
    • Minimizing flow time in a flow-line manufacturing cell with family setup times
    • Gupta, J.N.D. and Schaller, J. (2006) ‘Minimizing flow time in a flow-line manufacturing cell with family setup times’, Journal of the Operational Research Society, Vol. 57, No. 2, pp.163–176.
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.2 , pp. 163-176
    • Gupta, J.N.D.1    Schaller, J.2
  • 10
    • 0032120699 scopus 로고    scopus 로고
    • A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines
    • Hyun, C.J., Kim, Y. and Kim, Y.K. (1998) ‘A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines’, Computer and Operations Research, Vol. 25, Nos. 7/8, pp.675–690.
    • (1998) Computer and Operations Research , vol.25 , Issue.7-8 , pp. 675-690
    • Hyun, C.J.1    Kim, Y.2    Kim, Y.K.3
  • 12
    • 0035898985 scopus 로고    scopus 로고
    • Constructive and composite heuristic solutions to the P//£ Ci scheduling problem
    • Liu, J. and Reeves, C.R. (2001) ‘Constructive and composite heuristic solutions to the P//£ Ci scheduling problem’, European Journal of Operational Research, Vol. 132, No. 2, pp.439–452.
    • (2001) European Journal of Operational Research , vol.132 , Issue.2 , pp. 439-452
    • Liu, J.1    Reeves, C.R.2
  • 13
    • 27844495113 scopus 로고    scopus 로고
    • Coordination of set-ups between two stages of a supply chain using multi-objective genetic algorithms
    • Mansouri, S.A. (2005) ‘Coordination of set-ups between two stages of a supply chain using multi-objective genetic algorithms’, International Journal of Production Research, Vol. 43, No. 5, pp.3163–3180.
    • (2005) International Journal of Production Research , vol.43 , Issue.5 , pp. 3163-3180
    • Mansouri, S.A.1
  • 14
    • 0030241820 scopus 로고    scopus 로고
    • Multi-objective genetic algorithm and its applications to flowshop scheduling
    • Murata, T., Ishibuchi, H. and Tanaka, H. (1996) ‘Multi-objective genetic algorithm and its applications to flowshop scheduling’, Computers and Industrial Engineering, Vol. 130, No. 4, pp.957–968.
    • (1996) Computers and Industrial Engineering , vol.130 , Issue.4 , pp. 957-968
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 15
    • 0029322972 scopus 로고
    • A branch and bound approach for a two-machine flowshop scheduling problem
    • Nagar, A., Heragu, S.S. and Haddock, J. (1995) ‘A branch and bound approach for a two-machine flowshop scheduling problem’, Journal of the Operational Research Society, Vol. 46, No. 6, pp.721–734.
    • (1995) Journal of the Operational Research Society , vol.46 , Issue.6 , pp. 721-734
    • Nagar, A.1    Heragu, S.S.2    Haddock, J.3
  • 16
    • 0035501183 scopus 로고    scopus 로고
    • A new lower bound for the flow shop group scheduling problem
    • Schaller, J. (2001) ‘A new lower bound for the flow shop group scheduling problem’, Computer and Industrial Engineering, Vol. 41, No. 2, pp.151–161.
    • (2001) Computer and Industrial Engineering , vol.41 , Issue.2 , pp. 151-161
    • Schaller, J.1
  • 17
    • 0033720051 scopus 로고    scopus 로고
    • Scheduling a flowline manufacturing cell with sequence dependent family setup times
    • Schaller, J., Gupta, J.N.D. and Vakharia, A.J. (2000) ‘Scheduling a flowline manufacturing cell with sequence dependent family setup times’, European Journal of Operational Research, Vol. 125, No. 2, pp.324–339.
    • (2000) European Journal of Operational Research , vol.125 , Issue.2 , pp. 324-339
    • Schaller, J.1    Gupta, J.N.D.2    Vakharia, A.J.3
  • 19
    • 0027626538 scopus 로고
    • Scheduling a flow-line manufacturing cell: a tabu search approach
    • Skorin-Kapov, J. and Vakharia, A.J. (1993) ‘Scheduling a flow-line manufacturing cell: a tabu search approach’, International Journal of Production Research, Vol. 31, No. 5, pp.1721–1734.
    • (1993) International Journal of Production Research , vol.31 , Issue.5 , pp. 1721-1734
    • Skorin-Kapov, J.1    Vakharia, A.J.2
  • 20
    • 0000852513 scopus 로고
    • Multiobjective optimization using nondominated sorting in genetic algorithms
    • Srinivas, N. and Deb, K. (1994) ‘Multiobjective optimization using nondominated sorting in genetic algorithms’, Evolution Computation, Vol. 2, pp.221–248.
    • (1994) Evolution Computation , vol.2 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 21
    • 84989723711 scopus 로고
    • A simulation annealing approach to scheduling a manufacturing cell
    • Vakharia, A.J. and Chang, Y.L. (1990) ‘A simulation annealing approach to scheduling a manufacturing cell’, Naval Research Logistics, Vol. 37, No. 6, pp.559–577.
    • (1990) Naval Research Logistics , vol.37 , Issue.6 , pp. 559-577
    • Vakharia, A.J.1    Chang, Y.L.2
  • 22
    • 13544263208 scopus 로고    scopus 로고
    • A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
    • Varadharajan, T.K. and Rajendran, C. (2005) ‘A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs’, European Journal of Operational Research, Vol. 167, No. 3, pp.772–795.
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 772-795
    • Varadharajan, T.K.1    Rajendran, C.2


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