Abstract
A dynamic scheduling for the constrained resource with partially substitutability based on the critical chain can not only improve the work efficiency of the system, but also achieve the replacement of resources and reduce the utilization of the core resources. This problem is influenced by operating time and setup time of jobs and aims at minimizing total tardiness. Plant growth simulation algorithm is inspired by the photostrophism mechanism and mainly be utilized to solve the global optimization of integer programming problem in the beginning. It possesses the convenience to determine the parameters, stability and accuracy to solve the problem and excellent global optimization ability which make it get extensive and effective application and promotion in many engineering and technical fields. Firstly, describe the problem as a dynamic scheduling problem with machine eligibility restrictions who has machines in parallel with different speeds and jobs with different release date and due date. Secondly model the scheduling problem and design the rescheduling rule according to the time series of jobs. Thirdly, adopt and optimize the new algorithm-plant growth simulation algorithm to get optimization by iterating. Finally, conduct simulation experiment and test the feasibility and superiority of the method by comparing with PSO and GA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Betterton CE, Cox III, James F (2009) Espoused drum-buffer-rope flow control in serial lines: a comparative study of simulation models. Int J Prod Econ 117(1):66–79
Chen C, Chen C (2009) A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines. Comput Oper Res 36(11):3073–3081
Chen R, Wu C et al (2010) Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in psplib. Expert Syst Appl 37(3):1899–1910
Fang C, Wang L (2010) Survey on resource-constrained project scheduling. Control Decis 25(5):641–650
Fin A, Homberger J (2013) An ant-based coordination mechanism for resource-constrained project scheduling with multiple agents and cash flow objectives. Flex Serv Manuf J 25(1–2):94–121
Goldratt EM (1997) Critical chain: a business novel. North River Press, Great Barrington
Gonçalves JF, Resende MGC, Jorge JJM (2011) A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling proble. J Heuristics 17(5):467–486
Guo G (2011) Study on rescheduling method for flow shop problem with uncertainty. Huazhong University of Science and Technology (In Chinese)
Haibo T, Chunming Y (2010) Application of plant growth simulation algorithm to solving job shop scheduling problem. Mech Sci Technol Aerosp Eng 11:35
Li T, Wang Z (2008) Application of plant growth simulation algorithm on solving facility location problem. Syst Eng Theor Pract 28(12):107–115
Li T, Wang C et al (2005) A global optimization bionics algorithm for solving integer programming-plant growth simulation algorithm. Syst Eng Theor Pract 25(1):76–85
Liu S, Song J (2011) Combination of constraint programming and mathematical programming for solving resources-constrained project-scheduling problems. Control Theor Appl 28(8):1113–1120
Pinedo M (2012) Scheduling: theory, algorithms, and systems. Springer, Boston
Vanhoucke M (2012) Project management with dynamic scheduling. Springer, Berlin
Yang Q, Zhou G, Lin J (2012) Scheduling of machines in parallel with different speeds based on planted growth simulation algorithm—taking an example of the bottleneck in 4s auto dealership maintenance shop. Syst Eng Theor Pract 32(11):2433–2438
Acknowledgments
Project supported by National Natural Science Foundation of China 71202166; MOE (Ministry of Education in China) Project of Humanities and Social Sciences (Project No. 13YJC630202); The Department of Education Project of Sichuan Province (14ZA0026, 14SB0022).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, Q., Wang, Y., Wu, S., Wang, W., Wang, T. (2014). A New Algorithm for Dynamic Scheduling with Partially Substitutability Constrained Resource on Critical Chain. In: Xu, J., Cruz-Machado, V., Lev, B., Nickel, S. (eds) Proceedings of the Eighth International Conference on Management Science and Engineering Management. Advances in Intelligent Systems and Computing, vol 281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55122-2_86
Download citation
DOI: https://doi.org/10.1007/978-3-642-55122-2_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-55121-5
Online ISBN: 978-3-642-55122-2
eBook Packages: EngineeringEngineering (R0)