Skip to main content

Advertisement

SpringerLink
Log in

An effective detailed operation scheduling in MES based on hybrid genetic algorithm

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

A detailed operation scheduling solution based on hybrid genetic algorithm is proposed and integrated with the manufacturing execution system (MES) for multi-objective scheduling. The constraints and influences from real-time production information collected by MES will all be considered in scheduling procedures. Each order can be scheduled forward or backward and the various constraints such as the ones from working calendar, processing capacity of manufacturing resources and the connection type between the operation and the previous operation will be obeyed in scheduling. A genetic algorithm is designed according to the features of the scheduling problem. Two methods of operation sequence (OS) initialization (named as OSIOP and ROSI) and three methods of manufacturing resource selection (named as RSAPT, RSWTB and RRS) are designed for population initialization. A variable neighborhood search is designed and implanted in the process of GA to improve the scheduling results. The experiments are made and the results have proved the feasibility of the hybrid GA. This scheduling solution is programmed in \(\hbox {C}^{\#}\) and applied to a commercial MES software successfully.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  • Brucker, P., & Schlie, R. (1990). Job-shop scheduling with multi-purpose machines. Computing, 45(4), 369–375.

    Article  Google Scholar 

  • Chamnanlor, C., Sethanan, K., Gen, M., & Chien, C. F. (2015). Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. Journal of Intelligent Manufacturing. doi:10.1007/s10845-015-1078-92.

  • Chan, F. T., Chung, S. H., & Chan, P. L. Y. (2005). An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Systems with Applications, 29(2), 364–371.

    Article  Google Scholar 

  • Chang, H. C., & Liu, T. K. (2015). Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. Journal of Intelligent Manufacturing. doi:10.1007/s10845-015-1084-y.

  • Chen, H., Ihlow, J., & Lehmann, C. (1999). A genetic algorithm for flexible job-shop scheduling. In 1999 IEEE international conference on robotics and automation, 1999. Proceedings (Vol. 2, pp. 1120–1125). IEEE.

  • Chen, J. C., Chen, K. H., Wu, J. J., & Chen, C. W. (2008). A study of the flexible job shop scheduling problem with parallel machines and reentrant process. The International Journal of Advanced Manufacturing Technology, 39(3–4), 344–354.

    Article  Google Scholar 

  • Chen, K. J., & Ji, P. (2007). A genetic algorithm for dynamic advanced planning and scheduling (DAPS) with a frozen interval. Expert Systems with Applications, 33(4), 1004–1010.

    Article  Google Scholar 

  • Choi, I. C., & Choi, D. S. (2002). A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Computers and Industrial Engineering, 42(1), 43–58.

    Article  Google Scholar 

  • De Giovanni, L., & Pezzella, F. (2010). An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. European Journal of Operational Research, 200(2), 395–408.

    Article  Google Scholar 

  • Gao, J., Gen, M., & Sun, L. (2006). Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. Journal of Intelligent Manufacturing, 17(4), 493–507.

    Article  Google Scholar 

  • Gao, J., Gen, M., Sun, L., & Zhao, X. (2007). A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Computers and Industrial Engineering, 53(1), 149–162.

    Article  Google Scholar 

  • Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and Operations Research, 35(9), 2892–2907.

    Article  Google Scholar 

  • González, M. A., Vela, C. R., González-Rodríguez, I., & Varela, R. (2013). Lateness minimization with tabu search for job shop scheduling problem with sequence dependent setup times. Journal of Intelligent Manufacturing, 24(4), 741–754.

    Article  Google Scholar 

  • 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 and Industrial Engineering, 50(3), 202–219.

    Article  Google Scholar 

  • Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., & Chan, S. F. (2008). Genetic optimization of order scheduling with multiple uncertainties. Expert Systems with Applications, 35(4), 1788–1801.

    Article  Google Scholar 

  • Hansen, P., & Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449–467.

    Article  Google Scholar 

  • Ho, N. B., Tay, J. C., & Lai, E. M. K. (2007). An effective architecture for learning and evolving flexible job-shop schedules. European Journal of Operational Research, 179(2), 316–333.

    Article  Google Scholar 

  • Lee, K. M., Yamakawa, T., & Lee, K. M. (1998). A genetic algorithm for general machine scheduling problems. In 1998 Second international conference on knowledge-based intelligent electronic systems, 1998. Proceedings KES’98 (Vol. 2, pp. 60–66). IEEE.

  • Liu, M., Sun, Z. J., Yan, J. W., & Kang, J. S. (2011). An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem. Expert Systems with Applications, 38(8), 9248–9255.

    Article  Google Scholar 

  • Meeran, S., & Morshed, M. S. (2012). A hybrid genetic Tabu search algorithm for solving job shop scheduling problems: A case study. Journal of intelligent manufacturing, 23(4), 1063–1078.

    Article  Google Scholar 

  • Mencía, C., Sierra, M. R., & Varela, R. (2014). Intensified iterative deepening A* with application to job shop scheduling. Journal of Intelligent Manufacturing, 25(6), 1245–1255.

    Article  Google Scholar 

  • MESA International. (1997a). The benefits of MES: A report from the field. MESA International White Paper, (1).

  • MESA International. (1997b). MES functionalities and MRP to MES data flow possibilities. MESA International White Paper, (2).

  • Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097–1100.

    Article  Google Scholar 

  • Nie, L., Gao, L., Li, P., & Li, X. (2013). A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. Journal of Intelligent Manufacturing, 24(4), 763–774.

    Article  Google Scholar 

  • Park, B. J., Choi, H. R., & Kim, H. S. (2003). A hybrid genetic algorithm for the job shop scheduling problems. Computers and Industrial Engineering, 45(4), 597–613.

    Article  Google Scholar 

  • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers and Operations Research, 35(10), 3202–3212.

    Article  Google Scholar 

  • Rahnamayan, S., Tizhoosh, H. R., & Salama, M. (2007). A novel population initialization method for accelerating evolutionary algorithms. Computers and Mathematics with Applications, 53(10), 1605–1614.

    Article  Google Scholar 

  • Ventura, J. A., & Yoon, S. (2013). A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. Journal of Intelligent Manufacturing, 24(6), 1185–1196.

    Article  Google Scholar 

  • Vijayan, J. (2000). Manufacturing execution systems. Computerworld, 34(31), 38–42.

    Google Scholar 

  • Yazdani, M., Amiri, M., & Zandieh, M. (2010). Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Systems with Applications, 37(1), 678–687.

  • Zandieh, M., Mozaffari, E., & Gholami, M. (2010). A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. Journal of Intelligent Manufacturing, 21(6), 731–743.

    Article  Google Scholar 

  • Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38(4), 3563–3573.

    Article  Google Scholar 

  • Zhang, Q., Manier, H., & Manier, M. A. (2012). A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Computers and Operations Research, 39(7), 1713–1723.

    Article  Google Scholar 

  • Zhang, R., Chang, P., & Wu, C. (2013). A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production. International Journal of Production Economics, 145(1), 38–52.

    Article  Google Scholar 

Download references

Acknowledgments

The work in this paper is part of the project named the customizable MES platform applied to discrete manufacturing which is financially supported by the National Innovation Fund of China under Grant No. 2008GRP10017.

Author information

Authors and Affiliations

  1. Huazhong University of Science and Technology, Wuhan, Hubei, China

    Li Zhou, Zhuoning Chen & Shaoping Chen

Authors
  1. Li Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhuoning Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shaoping Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Zhou.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, L., Chen, Z. & Chen, S. An effective detailed operation scheduling in MES based on hybrid genetic algorithm. J Intell Manuf 29, 135–153 (2018). https://doi.org/10.1007/s10845-015-1097-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1097-6

Keywords

Search

Navigation