Abstract
For the production scheduling of bottleneck of pulling production systems with resource constraints, a time-margin-based heuristic algorithm (TMBHA) is proposed to realize the optimization of facility utilization and intermediate inventory based on discrete-event simulation. Compared with manual scheduling and genetic algorithm (GA), the result shows TMBHA is effective in the aspect of efficiency and computation time.
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
Bankston JB, Harnett RM (2000) A heuristic algorithm for a multi-product, single machine capacitated production scheduling problem. Comput Oper Res 27:77–92
Bao Z, Wang W, Peng W, Pan Q (2012) Research on Production Scheduling System with Bottleneck Based on Multi-agent. In: 2012 international conference on applied physics and industrial engineering, Physics Procedia, pp 1903–1909
Chan W-T, Hao H (2001) An application of genetic algorithms to precast production scheduling. Comput Struct 79:1605–1616
Chang J, Gong D, Ma X (2007) A heuristic genetic algorithm for no-wait flowshop scheduling problem. J China Univ Min Technol 17(4):0582–0586
Drobouchevitch IG, Strusevich VA (2001) Two-stage open shop scheduling with a bottleneck machine. Eur J Oper Res 128:159–174
Geraghty J, Heavey C (2004) A comparison of hybrid push/pull and CONWIP/pull production inventory control policies. Int J Prod Econ 91:75–90
Hirakawa Y (1996) Performance of a multistage hybrid push/pull production control. Int J Prod Econ 44:129–135
Pandey PC, Khokhajaikiat P (1996) Performance modeling of multistage production systems operating under hybrid push/pull control. Int J Prod Econ 43:17–28
Paraskevopoulos DC, Tarantilis CD, Ioannou G (2012) Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Syst Appl 39:3983–3994
Simth JS (2003) Survey on the user of simulation for manufacturing system design and operation. J Manuf Syst 22:157–171
Wang H, Wu K (2003) Modeling and analysis for multi-period, muiti-product and muiti-resource production scheduling. J Intell Manuf 14:297–309
Xiong G, Nyberg TR (2006) Push/pull production plan and schedule used in modern refinery CIMS. Robot Comput Integr Manuf 16:397–410
Yadav S, Xue D (2000) A multi-level heuristic search algorithm for production scheduling. Int J Prod Res 38(12):2761–2785
Yoo JK, Shinbo K, Shimizu Y (2003) A scheduling method for painting line under pull production. JSME Int J 46(1):88–92
Yuceer M, Berber R (2005) A heuristic approach for solution of MINLP problem for production scheduling in preemptive mode. Chem Eng Process 44:933–940
Acknowledgments
This research was supported by Chinese National Natural Science Foundation (61034004), Science and Technology Commission of Shanghai (10DZ1120100, 11ZR1440400), Program for New Century Excellent Talents in University (NCET-07-0622) and Shanghai Leading Academic Discipline Project (B004).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, W., Ma, Ym., Qiao, F. (2013). An Algorithm of Production Scheduling for Pulling Production Systems with Resource Constraints. In: Qi, E., Shen, J., Dou, R. (eds) International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012) Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38445-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-38445-5_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38444-8
Online ISBN: 978-3-642-38445-5
eBook Packages: EngineeringEngineering (R0)