A Methaheuristic optimization with continuous domain algorithm for green job shop scheduling problem

This paper addresses the multiple-route job shop scheduling problem with bath delivery time to minimize makespan the problem is recognized to be extremely difficult because of its combinatorial nature of integer optimization and the large size of the real problem. The goal is, thus, to obtain near-optimal schedules in a computationally efficient manner. In first mathematical formulation is presented. Then an approach based on ACOR is proposed. In order to evaluate the effectiveness of the proposed approach, 30 problems in small, medium, and large size are designed and solved using the proposed approach. Problems are also solved using Lingo software and the results are compared. The results show that the proposed algorithm yields better results than Lingo in terms of both solution and response time.

A Methaheuristic optimization with continuous domain algorithm for green job shop scheduling problem Keywords:

Multiple-route , Job shop scheduling , Ant Colony Optimization algorithm , Makespan , Batch delivery