Flexible job shop scheduling problem (FJSSP) contains two sub-problems, that is, routing and scheduling. Each operation is assigned to a machine among a set of alternative machines in the routing sub-problem, whereas the assigned operations on all machines are sequenced in the scheduling sub-problem to construct a feasible schedule. The operations cannot be processed without a qualified worker, but the worker constraint is usually ignored in the literature. The FJSSP which also considers the worker resource constraints is called the dual resource constrained FJSSP. Dual resource constrained FJSSP deals with machine assignment, order sequencing and worker assignment all together. Weighted Superposition Attraction (WSA), a recent metaheuristic approach is based on two basic mechanisms, ‘superposition’ and ‘attracted movement of agents’ for solving complex optimization problems algorithm is proposed to solve the dual resource constrained FJSSP with makespan minimization. Computational experiments performed in order to test the performance of the proposed WSA algorithm. The result of the WSA algorithm is compared with the results of the dispatching rule based approaches and greedy randomized adaptive search algorithm. The obtained results show that the WSA based algorithm is able to provide good quality solutions in reasonable time limits.

Keywords - Combinatorial Optimization, Flexible Job Shop Scheduling, Resource Constraints, Weighted Superposition Attraction Algorithm

[1] Baykasoğlu, A., and Özbakır, L. (2010). Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system. International Journal of Production Economics, 124(2), 369- 381.

[2] ElMaraghy, H., Patel, V., and Abdallah, I. B. (1999). A genetic algorithm based approach for scheduling of dual-resource constrainded manufacturing systems. CIRP Annals-Manufacturing Technology, 48(1), 369-372.

[3] Liu, X. X., Liu, C. B., and Tao, Z. (2011). Research on bi-objective scheduling of dual-resource constrained flexible job shop. In Advanced Materials Research (Vol. 211, pp. 1091-1095). Trans Tech Publications.

[4] Zhang, J., Jie, J., Wang, W., and Xu, X. (2017). A hybrid particle swarm optimisation for multi-objective flexible job-shop scheduling problem with dual-resources constrained. International Journal of Computing Science and Mathematics, 8(6), 526-532.

[5] Zhang, J., Wang, W., and Xu, X. (2017). A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility. Journal of Intelligent Manufacturing, 28(8), 1961-1972.

[6] Yazdani, M., Zandieh, M., Tavakkoli-Moghaddam, R., and Jolai, F. (2015). Two meta-heuristic algorithms for the dual-resource constrained flexible job-shop scheduling problem. Scientia Iranica, 22(3), 1242-1257.

[7] Zheng, X. L., and Wang, L. (2016). A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. International Journal of Production Research, 54(18), 5554-5566.

[8] Lei, D., and Guo, X. (2014). Variable neighbourhood search for dualresource constrained flexible job shop scheduling. International Journal of Production Research, 52(9), 2519-2529.

[9] Baykasoğlu, A., and Akpinar, Ş. (2017). Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization, Applied Soft Computing, 37, 396–415.

[10] Baykasoğlu, A., and Akpinar, Ş. (2015). Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 1: Unconstrained optimization, Applied Soft Computing, 56, 520–540.

[11] Baykasoğlu, A., and Karaslan, F. S. (2017). Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach, International Journal of Production Research, 55(11), 3308–3325.

[12] Baykasoğlu, A., and Şenol, M. E. (2019). Weighted Superposition Attraction Algorithm for Combinatorial Optimization. Expert Systems with Applications, https://doi.org/10.1016/j.eswa.2019.07.009