An ant colony optimization for continues domain algorithm for greenmultiple route job shop scheduling problem

This paper addresses the green multiple-route job shop scheduling problem to minimize cost and makespan. The problemis recognized to be extremely difficult because of its combinatorial nature of integer optimization and the large size ofthe real problem. The goal is, thus, to obtain near-optimal schedules in a computationally efficient manner. In the firstmathematical formulation is presented. Then an approach based on ACOR is proposed. In order to evaluate theeffectiveness of the proposed approach, ۳۰ problems are designed and solved using the proposed approach. Problemsare also solved using Lingo software and the results are compared. The results show that the proposed algorithm yieldsbetter results than Lingo in terms of both solution and response time.

کلیدواژه ها:

Green jobshop ، makespan ، scheduling ، multipleroute jobshop ، ant colony optimization