Dynamic group job shop scheduling

References

• Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985–1032.
   Web of Science ®Google Scholar
• Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159, 135–159.
   Web of Science ®Google Scholar
• Balas, E., Simonetti, N., & Vazacopoulos, A. (2008). Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling, 11, 253–262.
   Web of Science ®Google Scholar
• Canon, L.-C., & Jeannot, E. (2011). MO-Greedy: An extended beam-search approach for solving a multi-criteria scheduling problem on heterogeneous machines. In Proceedings of the IEEE international symposium on parallel and distributed processing workshops and PhD forum (pp. 57–69). Anchorage, AK.
   Google Scholar
• Chaudry, I. A., Khan, A. M., & Khan, A. A. (2013). A genetic algorithm for flexible job shop scheduling. In Proceedings of the world congress on engineering 2013 (Vol. 1, pp. 703–708). London.
   Google Scholar
• Chiang, T.-C., & Lin, H.-J. (2013). A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling. International Journal of Production Economics, 141, 87–98.
   Web of Science ®Google Scholar
• Eguchi, T., Nishi, K., Kawai, H., & Murayama, T. (2012). Job shop scheduling to meet due dates with consideration to sequence dependent setup times in a dynamic environment. In Proceedings of the ASME/ISCIE 2012 international symposium on flexible automation (pp. 365–368). St. Louis, MO.
   Google Scholar
• Fiala, P. (1997). Heuristic solving a bicriteria parallel-machine scheduling problem. Kibernetika, 33, 687–694.
   Web of Science ®Google Scholar
• Frutos, M., & Tohme, F. (2013). A multi-objective memetic algorithm for the job-shop scheduling problem. Operational Research, 13, 233–250.
   Web of Science ®Google Scholar
• González, M. A., Vela, C. R., González-Rodríguez, I., & Varela, R. (2013). Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times. Journal of Intelligent Manufacturing, 24, 741–754.
   Web of Science ®Google Scholar
• Li, J.-Q., Pan, Q.-K., & Chen, J. (2012). A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems. International Journal of Production Research, 50, 1063–1078.
   Web of Science ®Google Scholar
• Low, C., Wu, T.-H., & Hsu, C.-M. (2005). Mathematical modeling of multiobjective job shop scheduling with dependent setups and re-entrant operations. The International Journal of Advanced Manufacturing Technology, 27, 181–189.
   Web of Science ®Google Scholar
• Manikas, A., & Chang, Y.-L. (2009). Multi-criteria sequence-dependent job shop scheduling using genetics algorithms. Computers & Industrial Engineering, 56, 783–793.
   Web of Science ®Google Scholar
• Mauergauz, Y. (2012). Objectives and constraints in advanced planning problems with regard to scale of production output and plan hierarchical level. International Journal of Industrial and Systems Engineering, 12, 369–393.
   Google Scholar
• Mauergauz, Y. (2013). Cost-efficiency method for production scheduling. In Proceedings of the world congress on engineering 2013 (Vol. 1, pp. 587–593). London.
   Google Scholar
• Mauergauz, Y. (2014). Dynamic Pareto-optimal group scheduling for single machine. International Journal of Industrial and Systems Engineering, 16, 537–559.
   Google Scholar
• Moghaddas, R., & Houshmand, M. (2008). Job-shop scheduling problem with sequence dependent setup times. In Proceedings of the international multiconference of engineers and computer scientists (pp. 1–7). Hong Kong.
   Google Scholar
• Mokhtari, H., Abadi, I. N., & Cheraghalikhani, A. (2011). A multi-objective flow shop scheduling with resource-dependent processing times: Trade-off between makespan and cost of resources. International Journal of Production Research, 49, 5851–5875.
   Web of Science ®Google Scholar
• Moslehi, G., & Mahnam, M. (2011). A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. International Journal of Production Economics, 129, 14–22.
   Web of Science ®Google Scholar
• Nyhuis, P., & Wiendahl, H. P. (2009). Fundamentals of production logistics. Berlin: Springer.
   Google Scholar
• Park, J.-H., & Lee, D.-H. (2012). Job shop scheduling with job families and sequence-dependent setups: Minimizing the total family flow time. In Proceedings of the Asia Pacific industrial engineering & management systems conference (pp. 934–941). Phuket, Thailand.
   Google Scholar
• Pratchayaborirak, T., & Khachitvitchyanukul, V. (2011). A two-stage PSO algorithm for job shop scheduling problem. International Journal of Management Science and Engineering Management, 6, 83–92.
   Google Scholar
• Qian, B., Wang, L., Huang, D.-X., & Wang, X. (2008). Scheduling multi-objective job-shops using a memetic algorithm based on differential evolution. The International Journal of Advanced Manufacturing Technology, 35, 1014–1027.
   Web of Science ®Google Scholar
• Sha, D. Y., & Lin, H.-H. (2010). A multi-objective PSO for job-shop scheduling problems. Expert Systems and Applications, 37, 1065–1070.
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., Azarkish, M., & Sadeghnejad-Barkousaraie, A. (2011). Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto-archive PSO combined with genetic operators and VNS. International Journal of Advanced Manufacturing Technology, 53, 733–750.
   Web of Science ®Google Scholar
• Vilcot, G., & Billaut, J.-C. (2011). A Tabu search algorithm for solving a multicriteria flexible job shop scheduling problem. International Journal of Production Research, 49, 6963–6980.
   Web of Science ®Google Scholar