Abstract
Two bottleneck identification algorithms (one for bottleneck machines and the other for bottleneck jobs) are presented for the job shop scheduling problem in which the total weighted tardiness must be minimized. The scheduling policies on bottleneck machines can have significant impact on the final scheduling performance, and therefore, they need to be optimized with more computational effort. Meanwhile, bottleneck jobs that can cause considerable deterioration to the solution quality also need to be considered with higher priority. In order to describe the characteristic information concerning such bottleneck machines and bottleneck jobs, a statistical approach is devised to obtain the bottleneck characteristic values for each machine, and, in addition, a fuzzy inference system is employed to transform human knowledge into the bottleneck characteristic values for each job. These bottleneck characteristic values reflect the features of both the objective function and the current optimization stage. Finally, the effectiveness of the two procedures is verified by specifically designed genetic algorithms.
Similar content being viewed by others
References
Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391–401
Amirthagadeswaran KS, Arunachalam VP (2007) Enhancement of performance of genetic algorithm for job shop scheduling problems through inversion operator. Int J Adv Manuf Technol 32(7–8):780–786
Cheng R, Gen M (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms—Part I: representation. Comput Ind Eng 34(4):983–997
Cheng R, Gen M (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms—Part II: hybrid genetic search strategies. Comput Ind Eng 36(2):343–364
Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) A genetic-algorithm-based optimization model for scheduling flexible assembly lines. Int J Adv Manuf Technol 36(1–2):156–168
Ho TF, Li RK (2007) Bottleneck-based heuristic dispatching rule for optimizing mixed TDD/IDD performance in various factories. Int J Adv Manuf Technol. doi:10.1007/s00170-006-0875-x
Jain AS, Meeran S (1999) Deterministic job-shop scheduling: past, present and future. Eur J Oper Res 113(2):390–434
Jang JSR, Sun CT, Mizutani E (1997) Neuro-fuzzy and soft computing. Prentice-Hall, Englewood Cliffs
Jiao L, Wang L (2000) A novel genetic algorithm based on immunity. IEEE Trans Syst Man Cybern Syst Hum 30(5):552–561
Larrañaga P, Lozano JA (2002) Estimation of distribution algorithms: a new tool for evolutionary optimization. Kluwer Academic, Boston
Lenstra JK, Kan AHGR, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 7:343–362
Noorul Haq A, Balasubramanian K, Sashidharan B, Karthick RB (2008) Parallel line job shop scheduling using genetic algorithm. Int J Adv Manuf Technol 35(9–10):1047–1052
Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25(1):45–61
Roser C, Nakano M, Tanaka M (2002) Shifting bottleneck detection. In: Proceedings of the winter simulation conference, San Diego, 8–11 December 2002, pp 1079–1086
Singer M (2001) Decomposition methods for large job shops. Comput Oper Res 28(3):193–207
Varela R, Vela CR, Puente J, Gomez A (2003) A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. Eur J Oper Res 145(1):57–71
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82
Wu SD, Byeon ES, Storer RH (1999) A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Oper Res 47(1):113–124
Xu X, Li C (2007) Research on immune genetic algorithm for solving the job-shop scheduling problem. Int J Adv Manuf Technol 34(7–8):783–789
Zhang CY, Li PG, Rao YQ, Li SX (2005) A new hybrid GA/SA algorithm for the job shop scheduling problem. Lect Notes Comput Sci 3448:246–259
Zhang R, Wu C (2008) A hybrid approach to large-scale job shop scheduling. Appl Intell. doi:10.1007/s10489-008-0134-y
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, R., Wu, C. Bottleneck identification procedures for the job shop scheduling problem with applications to genetic algorithms. Int J Adv Manuf Technol 42, 1153–1164 (2009). https://doi.org/10.1007/s00170-008-1664-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-008-1664-5