메뉴 건너뛰기




Volumn , Issue , 2006, Pages 2993-2998

A memetic algorithm for multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; COST EFFECTIVENESS; OPTIMIZATION; PROBLEM SOLVING;

EID: 34547244691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (20)
  • 1
    • 0003449926 scopus 로고
    • Institute of Industrial engineers Press, Atlanta
    • Y. Monden, Toyota production system, Institute of Industrial engineers Press, Atlanta, 1983.
    • (1983) Toyota production system
    • Monden, Y.1
  • 2
    • 0001360372 scopus 로고
    • Level schedules for mixed-model assembly lines in just-in-time production systems
    • J. Miltenburg, "Level schedules for mixed-model assembly lines in just-in-time production systems," Management Science, vol. 35, no. 2, pp. 192-207, 1989.
    • (1989) Management Science , vol.35 , Issue.2 , pp. 192-207
    • Miltenburg, J.1
  • 3
    • 0025251040 scopus 로고
    • A dynamic programming algorithm for scheduling mixed-model just-in-time production systems
    • J. Miltenburg, G. Steiner, and S. Yeomans, "A dynamic programming algorithm for scheduling mixed-model just-in-time production systems," Mathematical Computation Modeling, vol. 13, pp. 57-66, 1990.
    • (1990) Mathematical Computation Modeling , vol.13 , pp. 57-66
    • Miltenburg, J.1    Steiner, G.2    Yeomans, S.3
  • 4
    • 0001602291 scopus 로고
    • Note on sequencing JIT mixed-model assembly lines
    • P.R. Inman, and R.L. Bulfin, "Note on sequencing JIT mixed-model assembly lines," Management Science, vol. 37, no. 7, pp. 910-904, 1991.
    • (1991) Management Science , vol.37 , Issue.7 , pp. 910-904
    • Inman, P.R.1    Bulfin, R.L.2
  • 5
    • 33845418462 scopus 로고
    • Sequencing to minimize work overload in assembly lines with product options
    • C.A. Yano, and R. Rachamadugu, "Sequencing to minimize work overload in assembly lines with product options," Management Science, vol. 37, pp. 572-586, 1991.
    • (1991) Management Science , vol.37 , pp. 572-586
    • Yano, C.A.1    Rachamadugu, R.2
  • 7
    • 0018469357 scopus 로고
    • A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor
    • K. Okamura, and H. Yamshina, "A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor," International Journal of Production Research, vol. 17, pp. 233-247, 1979.
    • (1979) International Journal of Production Research , vol.17 , pp. 233-247
    • Okamura, K.1    Yamshina, H.2
  • 8
    • 33344464311 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert (Accepted for publication)
    • to be published in, 10.1016/j.amc.2005.05.011
    • R. Tavakkoli-Moghaddam, G. Moslehi, M. Vasei, and A. Azaron, "A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert (Accepted for publication)," Applied Mathematics and Computation, to be published in 2006, 10.1016/j.amc.2005.05.011.
    • (2006) Applied Mathematics and Computation
    • Tavakkoli-Moghaddam, R.1    Moslehi, G.2    Vasei, M.3    Azaron, A.4
  • 9
    • 0000363908 scopus 로고
    • Sequencing mixed-model assembly lines to level parts usage and minimize the length
    • J.F. Bard, A. Shtub, and S.B. Joshi, "Sequencing mixed-model assembly lines to level parts usage and minimize the length," International Journal of Production Research, vol. 32, pp. 2431-2454, 1994.
    • (1994) International Journal of Production Research , vol.32 , pp. 2431-2454
    • Bard, J.F.1    Shtub, A.2    Joshi, S.B.3
  • 10
    • 0035341955 scopus 로고    scopus 로고
    • Bi-criteria sequencing methods for the mixed-model assembly line in just-in-time production systems
    • T. Korkmazel, and S. Meral, "Bi-criteria sequencing methods for the mixed-model assembly line in just-in-time production systems," European Journal of Operational Research, vol. 131, pp. 188-207, 2001.
    • (2001) European Journal of Operational Research , vol.131 , pp. 188-207
    • Korkmazel, T.1    Meral, S.2
  • 11
    • 0001169951 scopus 로고    scopus 로고
    • A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line
    • P.R. McMullen, and G.V. Frazier, "A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line," HE Transactions, vol. 32, no. 8, 679-686, 2000.
    • (2000) HE Transactions , vol.32 , Issue.8 , pp. 679-686
    • McMullen, P.R.1    Frazier, G.V.2
  • 12
    • 0032120278 scopus 로고    scopus 로고
    • JIT sequencing for mixed-model assembly lines with setups using tabu search
    • P.R. McMullen, "JIT sequencing for mixed-model assembly lines with setups using tabu search, "Production Planning and Control, vol. 9, no. 5, pp. 504-510, 1998.
    • (1998) Production Planning and Control , vol.9 , Issue.5 , pp. 504-510
    • McMullen, P.R.1
  • 13
    • 0035545592 scopus 로고    scopus 로고
    • An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics
    • P.R. McMullen, "An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics," Computers and Industrial Engineering, vol. 41, pp. 335-353, 2001.
    • (2001) Computers and Industrial Engineering , vol.41 , pp. 335-353
    • McMullen, P.R.1
  • 14
    • 0035973393 scopus 로고    scopus 로고
    • A Kohonen self-organizing map approach to addressing a multiple objective, mixed-model JIT sequencing problem
    • P.R. McMullen, "A Kohonen self-organizing map approach to addressing a multiple objective, mixed-model JIT sequencing problem," International Journal of Production Economics, vol. 72, pp. 59-71, 2001.
    • (2001) International Journal of Production Economics , vol.72 , pp. 59-71
    • McMullen, P.R.1
  • 15
    • 0035385251 scopus 로고    scopus 로고
    • An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives
    • P.R. McMullen, "An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives," Artificial Intelligence in Engineering, vol 15,pp. 309-317, 2001.
    • (2001) Artificial Intelligence in Engineering , vol.15 , pp. 309-317
    • McMullen, P.R.1
  • 16
    • 13544275547 scopus 로고    scopus 로고
    • A Multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines
    • S.A. Mansouri, "A Multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines," European Journal of Operational Research, vol. 167, pp. 696-716, 2005.
    • (2005) European Journal of Operational Research , vol.167 , pp. 696-716
    • Mansouri, S.A.1
  • 17
    • 33646749725 scopus 로고    scopus 로고
    • Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithms
    • R. Tavakkoli-Moghaddam, N. Safeei, and M. Babakhani, "Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithms," Lecture Notes in Computer Sciences, vol. 3777, pp. 213-227, 2005.
    • (2005) Lecture Notes in Computer Sciences , vol.3777 , pp. 213-227
    • Tavakkoli-Moghaddam, R.1    Safeei, N.2    Babakhani, M.3
  • 18
    • 0032120699 scopus 로고    scopus 로고
    • A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines
    • C.J. Hyun, Y. Kim, and Y.K. Kim, "A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines," Computers and Operations Research, vol. 25, nos. 7/8, pp. 675-690, 1998.
    • (1998) Computers and Operations Research , vol.25 , Issue.7-8 , pp. 675-690
    • Hyun, C.J.1    Kim, Y.2    Kim, Y.K.3


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