Advertisement

A Bilevel Intelligent Optimization Model for Assembly Line Scheduling with Flexible Operation Assignment

  • Zhaoxia GuoEmail author
Chapter

Abstract

This chapter addresses a scheduling problem in the flexible assembly line with flexible operation assignment. This problem is formulated with the objectives of minimizing the weighted sum of tardiness and earliness penalties and balancing the production flow of the flexible assembly line. A bilevel genetic algorithm-based optimization approach is developed to handle this scheduling problem, in which a novel chromosome representation is presented to handle the operation assignment of assigning one operation to multiple machines as well as multiple operations to one machine. Besides, a heuristic initialization process and modified genetic operators are presented as well. The proposed optimization approach is evaluated by a series of experiments based on real-world production data. Experimental results show that the proposed approach can solve the scheduling problem effectively.

Keywords

Bilevel genetic algorithm Flexible assembly line Scheduling 

References

  1. Bäck, T. (1994). Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In Proceedings of the First IEEE Conference on Evolutionary Computation, Orlando, USA, IEEE Press.Google Scholar
  2. Bector, C., Gupta, Y., & Gupta, M. (1988). Determination of an optimal common due date and optimal sequence in a single-machine job shop. International Journal of Production Research, 26(4), 613–628.CrossRefzbMATHGoogle Scholar
  3. Chan, F., & Chan, H. (2004). A comprehensive survey and future trend of simulation study on FMS scheduling. Journal of Intelligent Manufacturing, 15(1), 87–102.CrossRefGoogle Scholar
  4. Chen, J. F. (2005). Unrelated parallel machine scheduling with secondary resource constraints. International Journal of Advanced Manufacturing Technology, 26, 285–292.CrossRefGoogle Scholar
  5. Cheng, T. (1987). Minimizing the average deviation of job completion times about a common due-date—an extension. Mathematical Modelling, 9(1), 13–15.MathSciNetCrossRefzbMATHGoogle Scholar
  6. Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms: 1. representation. Computers & Industrial Engineering, 30(4), 983–997.CrossRefGoogle Scholar
  7. Cheng, R., Gen, M., & Tsujimura, Y. (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms: 2. hybrid genetic search strategies. Computers & Industrial Engineering, 37(1–2), 51–55.CrossRefGoogle Scholar
  8. Cheng, T., & Sin, C. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3), 271–292.MathSciNetCrossRefzbMATHGoogle Scholar
  9. Co, H., Jaw, T., & Chen, S. (1988). Sequencing in flexible manufacturing systems and other short queue-length systems. Journal of Manufacturing Systems, 7(1), 1–8.CrossRefGoogle Scholar
  10. Dar-El, E., & Sarin, S. (1984). Scheduling parts in FMS to achieve maximum machine utilization. In Proceedings of the First ORSA/TIMS Conference on FMS, Ann Arbor, MI.Google Scholar
  11. Engin, O., & Doyen, A. (2004). A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Computer Systems, 20(6), 1083–1095.CrossRefGoogle Scholar
  12. Eshelman, L. J., & Schaffer, J. D. (1993). Real-coded genetic algorithms and interval schemata. In L. D. Whitley (Ed.), Foundations of genetic algorithms (Vol. 2, pp. 187–202). San Mateo, CA: Morgan Kaufmann.Google Scholar
  13. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Massachusetts: Addison-Wesley.zbMATHGoogle Scholar
  14. Gordon, V., Proth, J., & Chu, C. (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139(1), 1–25.MathSciNetCrossRefzbMATHGoogle Scholar
  15. Graves, S. (1981). A review of production scheduling. Operations Research, 29(4), 646–675.MathSciNetCrossRefzbMATHGoogle Scholar
  16. Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., & Chan, S. F. (2006). Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry. Computers & Industrial Engineering, 50(3), 202–219.CrossRefGoogle Scholar
  17. Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., et al. (2008). A genetic-algorithm-based optimization model for scheduling flexible assembly lines. International Journal of Advanced Manufacturing Technology, 36(1–2), 156–168.CrossRefGoogle Scholar
  18. Hasija, S., & Rajendran, C. (2004). Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research, 42(11), 2289–2301.CrossRefzbMATHGoogle Scholar
  19. Hejazi, S., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research, 43(14), 2895–2929.CrossRefzbMATHGoogle Scholar
  20. Holland, J. H. (1975). Adaptation in natural and artificial systems. Michigan: University of Michigan Press.Google Scholar
  21. Lauff, V., & Werner, F. (2004a). On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties. Computers and Operations Research, 31(3), 317–345.MathSciNetCrossRefzbMATHGoogle Scholar
  22. Lauff, V., & Werner, F. (2004b). Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Mathematical and Computer Modelling, 40(5–6), 637–655.MathSciNetCrossRefzbMATHGoogle Scholar
  23. Michalewicz, Z. (1992). Genetic algorithm + data structures = evolution programs. New York, USA: Springer-Verlag.CrossRefzbMATHGoogle Scholar
  24. Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 18(2), 193–242.MathSciNetzbMATHGoogle Scholar
  25. Qi, X., Yin, G., & Birge, J. (2000). Single-machine scheduling with random machine breakdowns and randomly compressible processing times. Stochastic Analysis and Applications, 18(4), 635–653.MathSciNetCrossRefzbMATHGoogle Scholar
  26. Reisman, A., Kumar, A., & Motwani, J. (1997). Flowshop scheduling/sequencing research: A statistical review of the literature, 1952–1994. IEEE Transactions on Engineering Management, 44(3), 316–329.CrossRefGoogle Scholar
  27. Sabuncuoglu, I., & Gurgun, B. (1996). A neural network model for scheduling problems. European Journal of Operational Research, 93(2), 288–299.CrossRefzbMATHGoogle Scholar
  28. Salveson, M. E. (1952). On a quantitative method in production planning and scheduling. Econometrica, 20(4), 554–590.CrossRefzbMATHGoogle Scholar
  29. Stoop, P., & Wiers, V. (1996). The complexity of scheduling in practice. International Journal of Operations & Production Management, 16(10), 37–53.CrossRefGoogle Scholar
  30. Subramaniam, V., Lee, G., Ramesh, T., Hong, G., & Wong, Y. (2000). Machine selection rules in a dynamic job shop. International Journal of Advanced Manufacturing Technology, 16(12), 902–908.CrossRefGoogle Scholar
  31. Syswerda, G. (1991). Schedule optimization using genetic algorithms. In L. Davis (Ed.), Handbook of genetic algorithms (pp. 332–349). New York, Van Nostrand Reinhold.Google Scholar
  32. Wang, T., & Wu, K. (2000). A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems. International Journal of Systems Science, 31(4), 537–542.CrossRefzbMATHGoogle Scholar
  33. Yen, B., & Wan, G. (2003). Single machine bicriteria scheduling: A survey. International Journal of Industrial Engineering—Theory Applications and Practice, 10(3), 222–231.Google Scholar
  34. Ying, K., & Liao, C. (2003). An ant colony system approach for scheduling problems. Production Planning & Control, 14(1), 68–75.CrossRefGoogle Scholar
  35. Zhang, Y., Luh, P., Yoneda, K., Kano, T., & Kyoya, Y. (2000). Mixed-model assembly line scheduling using the Lagrangian relaxation technique. IIE Transactions, 32(2), 125–134.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Business SchoolSichuan UniversityChengduChina

Personalised recommendations