Anita Agárdi

Combination of Ant Algorithms and Simulated Annealing in solving Flow Shop Scheduling Problem

In this article, a common production scheduling task is presented and solved. This problem is the Flow Shop Scheduling. During the problem, given n jobs and m machines. All jobs must be processed in the same machine order. A job can only be started on a given machine if the processing on the previous machine has alread...