Scheduling parallel machines with sequence dependent set-up times in job shop industries using GA and SA

References

• Aydin, M.E. , & Fogarty, T.C. (2004). A simulated annealing algorithm for multi-agent system: Job shop scheduling application. International Journal of Advanced Manufacturing Technology, 15 (6), 805–814.
   Google Scholar
• Chakhlevitch, K. , & Glass, C.A. (2009). Scheduling reentrant jobs on parallel machines with a remote server. Computer and Operation Research, 36 (9), 2580–2589.
   Web of Science ®Google Scholar
• Chen, J. C. , Chen, K.H. , Wu, J.J. , & Chen, C.W. (2008). A study of the flexible job shop scheduling problem with parallel machines and reentrant process. International Journal of Advanced Manufacturing Technology, 39 (3–4), 344–354.
   Web of Science ®Google Scholar
• Charari, T. , Chaabane, S. , Loukil, T. , & Trentesaux, D. (2011). A genetic algorithm for hybrid flow shop scheduling. International Journal of Computer Integrated Manufacturing, 25 , 821–833.
   Google Scholar
• Deng, Y. , Zhenfu, Z. , & Qi, L. (2006). Ranking fuzzy numbers with an area method using Radius of Gyration. Computer and Mathematics with Application, 51 (6–7), 1127–1136.
   Web of Science ®Google Scholar
• Desprez, C. , Chu, F. , & Chu, C. (2009). Minimizing the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm. International Journal of Computer Integrated Manufacturing, 22 , 745–757.
   Web of Science ®Google Scholar
• Garey, M.R. , Johnson, D.S. , & Sethi, R. (1976). The complexity of flow shop and job shop scheduling, Mathematics of Operation Research, 1 (2), 117–129.
   Google Scholar
• Jain, A.S. , & Meeran, S. (1999). Deterministic job shop scheduling: Past, present and future. European Journal of Operation Research, 113 (2), 390–434.
   Web of Science ®Google Scholar
• Lee, H.Y. , & Lee, T.E. (2006). Scheduling single-armed cluster tools with reentrant wafer flows. IEEE Transaction of Semiconductor Manufacturing, 19 (2), 226–240.
   Web of Science ®Google Scholar
• Lei, D. (2010). Fuzzy job shop scheduling problem with availability constraints. Computer and Industrial Engineering, 58 (4), 610–617.
   Web of Science ®Google Scholar
• Lin, F.T. (2002). Fuzzy job shop scheduling based on ranking level (λ,1) interval-valued fuzzy numbers. IEEE Transaction of Fuzzy System, 10 (4), 510–522,
   Web of Science ®Google Scholar
• Mahmodi Nejad, A. , & Mashinchi, M. (2011). Ranking fuzzy numbers based on the areas on the left and right sides of fuzzy number. Computer and Mathematics with Application, 61 (2), 431–442.
   Web of Science ®Google Scholar
• Manikas, A. , & Chang, Y.L. (2009). Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Computer and Industrial Engineering, 56 (1), 179–185.
   Web of Science ®Google Scholar
• Mason, S.J. , Fowler, J.W. , & Matthew Carlyle, W. (2002). A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5 (3), 247–262.
   Web of Science ®Google Scholar
• Mattfeld, D.C. , & Bierwirth, C. (2004). An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operation Research, 155 (3), 616–630.
   Web of Science ®Google Scholar
• Mohammadi, G. , & Ozbayrak, M. (2006). Scheduling mixed-model final assembly lines in JIT manufacturing. International Journal of Computer integrated Manufacturing, 19 (4), 377–382.
   Web of Science ®Google Scholar
• Naderi, B. , Fatemi Ghomi, S. M.T. , & Aminnayeri, M. (2010). A high performing metaheuristic for job shop scheduling with sequence-dependent setup times. Applied Soft Computing, 10 (3), 703–710.
   Web of Science ®Google Scholar
• Niu, Q. , & Jiao, B. (2008). Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time. Applied Mathematics and Computation, 205 (1), 148–158.
   Web of Science ®Google Scholar
• Pan, J.C.H. , & Chen, J.S. (2005). Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Computer and Operation Research, 32 (5), 1197–1212.
   Web of Science ®Google Scholar
• Park, B.J. , Choi, H.R. , & Kim, H.S. (2003). A hybrid genetic algorithm for the job shop scheduling problems. Computer and Industrial Engineering, 45 (4), 597–613.
   Web of Science ®Google Scholar
• Rajkumar, R. , & Shahabudeen, P. (2009). Bi-criteria improved genetic algorithm for scheduling in flow shops to minimize makespan and total flow time of job. International Journal of Computer Integrated Manufacturing, 22 , 987–998.
   Web of Science ®Google Scholar
• Rajesh, R. , Pugazhendhi, S. , & Ganesh, K. (2011). Simulated annealing algorithm for balanced allocation problem. International Journal of Advanced Manufacturing Technology, 61 (5), 431–440.
   Web of Science ®Google Scholar
• Sakawa, M. , & Kubato, R. (2000). Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithms. European Journal of Operation Research, 120 (2), 393–407.
   Web of Science ®Google Scholar
• Sakawa, M. , & Mori, T. (1999). An efficient genetic algorithm for job shop scheduling problem with fuzzy processing time and fuzzy due date. Computer and Industrial Engineering, 36 (2), 325–341.
   Web of Science ®Google Scholar
• Satake, T. , Morikawa, K. , Takahashi, K. , & Nakamura, N. (1999). Simulated annealing approach for minimizing the makespan of the general job shop. International Journal of Production Economic, 60 (1), 515–522.
   Google Scholar
• Sun, J.U. (2009). A genetic algorithm for a reentrant job shop scheduling problem with sequence dependent setup times. Engineering Optimization, 41 (6), 505–520.
   Web of Science ®Google Scholar
• Talbi, E. (2009). Metaheuristics from design to implementation . Hoboken, NJ: John Wiley & Sons.
   Google Scholar
• Valente, J.M.S. , & Gonçalves, J.F. (2009). A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Computer and Operation Research, 36 (10), 2707–2715.
   Web of Science ®Google Scholar
• Watanabe, M. , Ida, K. , & Gen, M. (2005). A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computer and Industrial Engineering, 48 (4), 743–751.
   Web of Science ®Google Scholar
• Zhang, R. , & Wu, C. (2011). A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Computer and Operation Research, 38 (5), 854–867.
   Web of Science ®Google Scholar