메뉴 건너뛰기




Volumn 47, Issue 20, 2009, Pages 5829-5842

Composition of module stock for final assembly using an enhanced genetic algorithm

Author keywords

Data mining; Product design; Productivity improvement

Indexed keywords

ADAPTIVE RATE; CROSSOVER OPERATIONS; DESIGN PROBLEMS; ENHANCED GENETIC ALGORITHMS; FINAL ASSEMBLY; PROCESSING TIME; PRODUCTIVITY IMPROVEMENT; TIME CONSTRAINTS;

EID: 70449580997     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802161030     Document Type: Article
Times cited : (5)

References (21)
  • 3
    • 1542475878 scopus 로고    scopus 로고
    • Local scheduling problems submitted to global FIFO processing constraints
    • Bernier, V. and Frein, Y., 2004. Local scheduling problems submitted to global FIFO processing constraints. International Journal of Production Research, 42 (8), 1483-1503.
    • (2004) International Journal of Production Research , vol.42 , Issue.8 , pp. 1483-1503
    • Bernier, V.1    Frein, Y.2
  • 4
    • 19444366732 scopus 로고    scopus 로고
    • The optimal diversity management problem
    • Briant, O. and Naddef, D., 2004. The optimal diversity management problem. Operations Research, 52 (4), 515-526.
    • (2004) Operations Research , vol.52 , Issue.4 , pp. 515-526
    • Briant, O.1    Naddef, D.2
  • 5
    • 77950515757 scopus 로고    scopus 로고
    • Supply chain coordination with contracts
    • S. Graves and T. de Kok, eds. North Holland: Elsevier
    • Cachon, G., 2003. Supply chain coordination with contracts. In: S. Graves and T. de Kok, eds. Handbooks in operations research and management science. North Holland: Elsevier, 229-340.
    • (2003) Handbooks in Operations Research and Management Science , pp. 229-340
    • Cachon, G.1
  • 6
    • 39149112943 scopus 로고    scopus 로고
    • Genetic algorithm and other meta-heuristics-the essential tools for solving modern supply chain management problems
    • C.K. Chan and W.H.J. Lee, eds. PA: Idea Group Publishing
    • Cheung, B.K-S., 2005. Genetic algorithm and other meta-heuristics-the essential tools for solving modern supply chain management problems. In: C.K. Chan and W.H.J. Lee, eds. Successful strategies in supply chain management. PA: Idea Group Publishing, 144-173.
    • (2005) Successful Strategies in Supply Chain Management , pp. 144-173
    • Cheung, B.K-S.1
  • 7
    • 0000301097 scopus 로고
    • A greedy heuristic for the set covering problem
    • Chvatal, V., 1979. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4 (3), 233-235.
    • (1979) Mathematics of Operations Research , vol.4 , Issue.3 , pp. 233-235
    • Chvatal, V.1
  • 11
    • 36249032427 scopus 로고    scopus 로고
    • Least in-sequence probability heuristic for mixed-volume production lines
    • Gusikhim, O., Caprihan, R., and Stecke, K., 2008. Least in-sequence probability heuristic for mixed-volume production lines. International Journal of Production Research, 46 (3), 647-673.
    • (2008) International Journal of Production Research , vol.46 , Issue.3 , pp. 647-673
    • Gusikhim, O.1    Caprihan, R.2    Stecke, K.3
  • 14
    • 0032643783 scopus 로고    scopus 로고
    • A methodology of developing product family architecture for mass customization
    • Jiao, J. and Tseng, M., 1999. A methodology of developing product family architecture for mass customization. Journal of Intelligent Manufacturing, 10 (1), 3-20.
    • (1999) Journal of Intelligent Manufacturing , vol.10 , Issue.1 , pp. 3-20
    • Jiao, J.1    Tseng, M.2
  • 15
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • Johnson, D., 1974. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9, 256-278.
    • (1974) Journal of Computer and System Sciences , vol.9 , pp. 256-278
    • Johnson, D.1
  • 16
    • 21144456733 scopus 로고    scopus 로고
    • Modular and platform methods for product family design: Literature analysis
    • Jose, A. and Tollenaere, M., 2005. Modular and platform methods for product family design: literature analysis. Journal of Intelligent Manufacturing, 16 (3), 373-392.
    • (2005) Journal of Intelligent Manufacturing , vol.16 , Issue.3 , pp. 373-392
    • Jose, A.1    Tollenaere, M.2
  • 17
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. Miller and J. Thatcher, eds. New York: Plenum Press
    • Karp, R., 1972. Reducibility among combinatorial problems. In: R. Miller and J. Thatcher, eds. Complexity of computer computations. New York: Plenum Press, 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.1
  • 18
    • 0028514351 scopus 로고
    • On the hardness of approximating minimization problems
    • Lund, C. and Yannakakis, M., 1994. On the hardness of approximating minimization problems. Journal of the ACM, 41 (5), 960-981.
    • (1994) Journal of the ACM , vol.41 , Issue.5 , pp. 960-981
    • Lund, C.1    Yannakakis, M.2
  • 21
    • 0001432841 scopus 로고
    • Modular production - A new concept
    • Nov-Dec
    • Starr, M., 1965. Modular production - a new concept. Harvard Business Review, Nov-Dec, 131-142.
    • (1965) Harvard Business Review , pp. 131-142
    • Starr, M.1


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