References
- Ak, B., & Koc, E. (2012). A guide for genetic algorithm based on parallel machine scheduling and flexible job-shop scheduling. Procedia – Social and Behavioral Sciences, 62, 817–823. https://doi.org/https://doi.org/10.1016/j.sbpro.2012.09.138
- Baker, K., & Kanet, J. (1983, November). Job shop scheduling with modified due dates. Operations Management, 4(1), 11–22. https://doi.org/https://doi.org/10.1016/0272-6963(83)90022-0
- Benttaleb, M., Hnaien, F., & Yalaoui, F. (2016). Two-machine job shop problem for makespan minimization under availability constraint. IFAC-PapersOnLine, 49(28), 132–137. https://doi.org/https://doi.org/10.1016/j.ifacol.2016.11.023
- Branke, J., Nguyen, S., Pickardt, C., & Zhang, M. (2016). Automated design of production scheduling heuristics: A review. IEEE Transactions on Evolutionary Computation, 20(1), 110–124. https://doi.org/https://doi.org/10.1109/TEVC.2015.2429314
- Chen, J., Wu, C.-C., Chen, C.-W., & Chen, K.-H. (2012). Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm. Expert Systems with Applications, 39(11), 10016–10021. https://doi.org/https://doi.org/10.1016/j.eswa.2012.01.211
- Dauzere-peres, S., & Paulli, J. (1997). An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. 70, 281–306. https://doi.org/https://doi.org/10.1023/A:1018930406487
- Dorigo, M., Colorni, A., & Maniezzo, V. (1992). Distributed optimization by ant colonies.
- Elmi, A., & Topaloglu, S. (2017). Cyclic job shop robotic cell scheduling problem: Ant colony optimization. Computers & Industrial Engineering, 111, 417–432. https://doi.org/https://doi.org/10.1016/j.cie.2017.08.005
- Gao, K. Z., Suganthan, P. N., Chua, T. J., Chong, C. S., Cai, T. X., & Pan, Q. K. (2015). A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Systems with Applications.42(21), 7652–7663. URL: https://doi.org/10.1016/j.eswa.2015.06.004.
- Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35(9), 2892–2907. https://doi.org/https://doi.org/10.1016/j.cor.2007.01.001
- Geem, Z. W., Kim, J. H., & Loganathan, G. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2), 60–68. https://doi.org/https://doi.org/10.1016/j.cor.2007.01.001
- Graham. (1966, July 11). Bounds for certain multiprocessing anomalies. Bell System Technical.
- Graham, L., Lenstra, D., & Kan, R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326. https://doi.org/https://doi.org/10.1016/S0167-5060(08)70356-X
- Ho, N., & Tay, J. (2004). An efficient cultural algorithm for solving the flexible job-shop problem.
- Johnson. (1954). Optimal two- and three-stage production schedules with setup times included.
- Kaplanoglu, V. (2015, September 24). An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Systems with Applications, 45, 71–84.https://doi.org/https://doi.org/10.1016/j.eswa.2015.09.050
- Karimi, H., Rahmati, S., & Zandieh, M. (2012, June 27). An efficient knowledge-based algorithm for the flexible job shop scheduling problem. Knowledge-Based Systems, 36, 236–244. https://doi.org/https://doi.org/10.1016/j.knosys.2012.04.001
- Mohammadi, G. (2017, April 7). Scheduling parallel machines with sequence dependent set-up times in job shop industries using GA and SA. International Journal of Systems Science: Operations & Logistics, 5(3), 282–294. https://doi.org/https://doi.org/10.1080/00207721.2017.1305133
- Mousakhani. (2013, October 22). Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. International Journal of Production Research, 51(12), 3476–3487. https://doi.org/https://doi.org/10.1080/00207543.2012.746480
- Pezzella, F., Morganti, G., & Ciaschetti, G. (2007, March 1). A genetic algorithm for the flexible Job-shop scheduling problem. Computers & Operations Research, 35(10), 3202–3212. https://doi.org/https://doi.org/10.1016/j.cor.2007.02.014
- Pinedo, M., & Hadavi, K. (1992). Scheduling: Theory, algorithms and systems development. Operations Research Proceedings. https://doi.org/https://doi.org/10.1007/978-3-642-46773-8_5
- Qiang Liu, S., & Kozan, E. (2016, April 26). Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements. Computers & Operations Research, 31–41. https://doi.org/https://doi.org/10.1016/j.cor.2016.04.023
- Qiang Liu, S., Kozan, E., Masoud, M., Zhang, Y., & Chan, F. (2017, November 17). Job shop scheduling with a combination of four buffering constraints. Production Research, 3274–3293. https://doi.org/https://doi.org/10.1080/00207543.2017.1401240
- Sels, V., Gheysen, N., & Vanhoucke, M. (2012, September 7). A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Production Research, 50(15). https://doi.org/https://doi.org/10.1080/00207543.2011.611539
- Shen, L., Dauzere-Peres, S., & Neufeld, J. (2017, August 11). Solving the flexible job shop scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 265(2), 4255–4270. https://doi.org/https://doi.org/10.1016/j.ejor.2017.08.021
- Tamssaouet, K., Dauzere-Peres, S., & Yugma, C. (2018, August 6). Metaheuristics for the job-shop scheduling problem with machine availability constraints. Computers & Industrial Engineering, 125, 1–8.https://doi.org/ https://doi.org/10.1016/j.cie.2018.08.008
- Wu, X., & Sun, Y. (2017, October 31). A Green scheduling algorithm for flexible Job shop with energy-saving measures. Cleaner Production, 172, 3249–3264. https://doi.org/https://doi.org/10.1016/j.jclepro.2017.10.342
- Wu, Z., Sun, S., & Yu, S. (2020, April 15). Optimizing makespan and stability risks in job shop scheduling. Computers and Operations Research, 122, 104963. https://doi.org/https://doi.org/10.1016/j.cor.2020.104963
- Xie, N., & Chen, N. (2018, June 6). Flexible job shop scheduling problem with interval grey processing time. Applied Soft Computing, 70, 513–524. https://doi.org/https://doi.org/10.1016/j.asoc.2018.06.004
- Yazdani, M., Aleti, A., Khalili, S., & Jolai, F. (2017, February 23). Optimising the sum of maximum earliness and tardiness of the job shop scheduling problem. Computers & Industrial Engineering, https://doi.org/https://doi.org/10.1016/j.cie.2017.02.019
- Yazdani, M., Amiri, M., & Zandieh, M. (2010). Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Systems with Applications, 37(1), 678–687. https://doi.org/https://doi.org/10.1016/j.eswa.2009.06.007
- Yuan, Y., & Xu, H. (2013, March 14). Flexible job shop scheduling using hybrid differential evolution algorithms. Computers & Industrial Engineering, 65(2), 246–260. https://doi.org/https://doi.org/10.1016/j.cie.2013.02.022
- Yuan, Y., Xu, H., & Yang, J. (2013). A hybrid harmony search algorithm for the flexible job shop scheduling problem. Applied Soft Computing, 13(7), 3259–3272. https://doi.org/https://doi.org/10.1016/j.asoc.2013.02.013
- Zandieh, M., Khatami, , A., , & Rahmati, , S., (2017, April 26). Flexible job shop scheduling under condition-based maintenance: Improved version of imperialist competitive algorithm. Applied Soft Computing, 58, 449–464. https://doi.org/https://doi.org/10.1016/j.asoc.2017.04.060
- Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38(4), 3563–3573. https://doi.org/https://doi.org/10.1016/j.eswa.2010.08.145
- Zhang, G., Hu, Y., Sun, J., & Zhang, W. (2020). An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm and Evolutionary Computation, 54, 100664. https://doi.org/https:doi.org/10.1016/j.swevo.2020.100664
- Zhang, G., Zhang, L., Song, X., Wang, Y., & Zhou, C. (2018). A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. 22, 11561–11572. https://doi.org/https://doi.org/10.1007/s10586-017-1420-4
- Zhu, Z., & Zhou, X. (2020, January 8). An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints. Computers & Industrial Engineering, 140, 106280. https://doi.org/https://doi.org/10.1016/j.cie.2020.106280