Dual-Resource Constrained Flexible Job Shop Scheduling Problem with Weighted Superposition Attraction Algorithm

Madenoğlu F. S., Baykasoğlu A.

International Congress on Human-Computer Interaction, Optimization and Robotic Applications, Nevşehir, Türkiye, 5 - 07 Temmuz 2019, ss.167-170

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Nevşehir
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.167-170
  • Abdullah Gül Üniversitesi Adresli: Evet

Özet

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.