Abstract
A successive genetic algorithm is proposed for solving job shop scheduling problems in which the total weighted tardiness should be minimized. In each iteration, the following three steps are performed. First, a new subproblem is defined by extracting a subset of operations from the entire operation set. Then, the jobs’ bottleneck characteristic values are introduced to depict the criticality of each operation in the current subproblem. Finally, a genetic algorithm is applied to optimize the production sequence of these operations based on the bottleneck information. Numeric computations show that the proposed algorithm is effective for solving the job shop scheduling problem.
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
Preview
Unable to display preview. Download preview PDF.
References
Bassett, M.H., Pekny, J.F., Reklaitis, G.V.: Decomposition techniques for the solution of large-scale scheduling problems. AICHE Journal 42(12), 3373–3387 (1996)
Byeon, E.S., Wu, S.D., Storer, R.H.: Decomposition heuristics for robust job-shop scheduling. IEEE Transactions on Robotics and Automation 14(2), 303–313 (1998)
Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113(2), 390–434 (1999)
Jia, Z., Lu, X., Yang, J., Jia, D.: Research on job-shop scheduling problem based on genetic algorithm. International Journal of Production Research 49(12), 3585–3604 (2011)
Jiao, L., Wang, L.: A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man and Cybernetics, Part A 30(5), 552–561 (2000)
Lenstra, J.K., Kan, A.H.G.R., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 7, 343–362 (1977)
Liu, M., Sun, Z., Yan, J., Kang, J.: An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem. Expert Systems with Applications 38(8), 9248–9255 (2011)
Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems, 3rd edn. Springer, New York (2008)
Sidney, J.B.: Decomposition algorithms for single machine sequencing with precedence relations and deferral costs. Operations Research 23(2), 283–298 (1975)
Singer, M.: Decomposition methods for large job shops. Computers and Operations Research 28(3), 193–207 (2001)
Sun, D., Batta, R.: Scheduling larger job shops: a decomposition approach. International Journal of Production Research 34(7), 2019–2033 (1996)
Wu, S.D., Byeon, E.S., Storer, R.H.: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Operations Research 47(1), 113–124 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, R. (2012). A Successive Genetic Algorithm for Solving the Job Shop Scheduling Problem. In: Jin, D., Lin, S. (eds) Advances in Electronic Engineering, Communication and Management Vol.1. Lecture Notes in Electrical Engineering, vol 139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27287-5_99
Download citation
DOI: https://doi.org/10.1007/978-3-642-27287-5_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27286-8
Online ISBN: 978-3-642-27287-5
eBook Packages: EngineeringEngineering (R0)