Abstract
In production scheduling more and more scholars are concerned with the handling of bottlenecks, and the actual bottleneck scheduling is a multiobjective problem, and these objectives often conflict with each other. How to balance the different objectives in bottleneck system and realize the multiobjective Job shop scheduling is very worthwhile study. This paper summarizes the existing bottleneck scheduling methods on the basis of literature research, and puts forward multiple objectives production scheduling model based on the single objective production scheduling at the same time to solve the model using the multiobjective genetic algorithm. Examples show that the proposed multiobjective method is more effective than the single in the actual practice.
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
Similar content being viewed by others
References
Chen X, Wu Z (2005) Production and operations management. Tsinghua university press, Beijing, pp 233–238
Koksalan M, Burak Keha A (2003) Using genetic algorithms for single-machine bicriteria scheduling problems. Eur J Oper Res 151(2):296–306
Liu M (2001) Production logistics management model and its key technology research based on ERP and TOC. Zhejiang University of Technology, Zhejiang (In Chinese)
Mattfeld DC, Bierwirth C (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur J Oper Res 155(2):616–630
Min L, Cheng W (1999) A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artif Intell Eng 13(4):399–403 (In Chinese)
Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45(4):597–613
Sevaux M, Dauzere-pere-peres S (2003) Genetic algorithms to minimize the weighted number of late jobs on a single machine. Eur J Oper Res 145(3):43–556
Wen Ding, Li Hou, Aixia Zhang (2011) A bottleneck resource identification method for completing the workpiece based on the shortest delay time. 2nd international conference on artificial intelligence management science and electronic commerce 2011, no. 08, pp 9–14
Acknowledgments
The research has been sponsored by Youth Foundation of Henan Polytechnic University with authorized number of Q2011-07 and Dr Fund projects with number of B2011-088. We also would like to express our thanks to the IEEM committee for providing this chance to present our research.
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
Ding, W. (2013). The Research of Multiobjective Bottleneck Scheduling Based on Genetic Algorithm. 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_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-38445-5_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38444-8
Online ISBN: 978-3-642-38445-5
eBook Packages: EngineeringEngineering (R0)