Advertisement

Sequencing Mixed-Model Assembly Lines with Limited Intermediate Buffers by a GA/SA-Based Algorithm

  • Binggang Wang
  • Yunqing Rao
  • Xinyu Shao
  • Mengchang Wang
Part of the Communications in Computer and Information Science book series (CCIS, volume 15)

Abstract

This study is concerned about how to optimize the input sequence of product models in Mixed-Model Assembly Lines (MMALs) with limited intermediate buffers.Two objectives are considered simultaneously: minimizing the variation in parts usage and minimizing the makespan. The mathematical model is presented by incorporating the two objectives according to their relative importance weights. A hybrid algorithm (GASA), based on a genetic algorithm (GA) and a simulated annealing algorithm (SA), is proposed for solving the model. The performance of the GASA is compared with the GA over various test problems. The results show that, in terms of solutions’ quality, both the GASA and GA can find the same best solution for small-sized problems and the GASA performs better than the GA for mediate and large-sized problems. Moreover, the impact of buffer size on MMAL’s performance is investigated.

Keywords

Mixed-model assembly lines Limited intermediate buffers  Sequencing GA/SA-based algorithms Genetic algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Monden, Y.: Toyota Production System, 2nd edn. Institute of Industrial Engineers, Norcross, Georgia (1993)Google Scholar
  2. 2.
    Cakir, A., Inman, R.R.: Modified Goal Chasing for Products with Non-Zero/One Bills of Material. Int. J. Prod. Res. 31(1), 107–115 (1993)CrossRefGoogle Scholar
  3. 3.
    Miltenburg, J., Sinnamon, G.: Scheduling Mixed-Model Multi-Level Just-In-Time Production Systems. Int. J. Prod. Res. 27, 1487–1509 (1989)CrossRefGoogle Scholar
  4. 4.
    Miltenburg, J., Sinnamon, G.: Algorithms for Scheduling Multi-Level Just-In-Time Production Systems. IIE Transactions 24, 121–130 (1992)CrossRefGoogle Scholar
  5. 5.
    Leu, Y.-Y., Matheson, L.A., Rees, L.P.: Sequencing Mixed Model Assembly Lines with Genetic Algorithms. Comput. Indus. Engin. 30(4), 1027–1036 (1996)CrossRefGoogle Scholar
  6. 6.
    Leu, Y.-Y., Huang, P.Y., Russell, R.S.: Using Beam Search Techniques for Sequencing Mixed-Model Assembly Lines. Ann. Oper. Res. 70, 379–397 (1997)zbMATHCrossRefGoogle Scholar
  7. 7.
    Bard, J.F., Shtub, A., Joshi, S.B.: Sequencing Mixed-Model Assembly Lines to Level Parts Usage and Minimizing Line Length. Int. J. Prod. Res. 32(10), 2431–2454 (1994)zbMATHCrossRefGoogle Scholar
  8. 8.
    Hyun, C.J., Kim, Y., Kim, Y.K.: A Genetic Algorithm for Multiple Objective Sequencing Problems in Mixed Model Assembly Lines. Comput. Oper. Res. 25(7/8), 675–690 (1998)zbMATHGoogle Scholar
  9. 9.
    Guo, Z.X., Wong, W.K., Leung, S.Y.S., Fan, J.T.: A Genetic-Algorithm-Based Optimization Model for Scheduling Flexible Assembly Lines. Int. J. Adv. Manuf. Technol. (2006) DOI: 10.1007/s00170-006-0818-6Google Scholar
  10. 10.
    Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R.: Multi-Criteria Sequencing Problem for a Mixed-Model Assembly Line in a JIT Production System. Appl. Math. Comput. 181, 1471–1481 (2006)zbMATHCrossRefGoogle Scholar
  11. 11.
    Yu, J.f., Yin, Y.H., Chen, Z.N.: Scheduling of an Assembly Line with a Multi-Objective Genetic Algorithm. Int. J. Adv. Manufact. Technol. 28, 551–555 (2006)CrossRefGoogle Scholar
  12. 12.
    Nowicki, E.: The Permutation Flow Shop with Buffers: a Tabu Search Approach. European J. Operat. Res. 116, 205–219 (1999)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Binggang Wang
    • 1
  • Yunqing Rao
    • 1
  • Xinyu Shao
    • 1
  • Mengchang Wang
    • 1
  1. 1.The State Key Laboratory of Digital Manufacturing Equipment and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations