Rights accessRestricted access - confidentiality agreement
This paper discusses the problems of scheduling where o batches can be processed by m parallel unrelated machines. Each of the baches is composed of: a single piece r, a quantity qr and due date dr. Moreover, each machine j allocated you a unit processing time for each piece i (pij) as a time of change of product (hi'ij). The objective is to assign each bach between the different machines so that the overall delay will be minimal. Even the high computing power, the time to optimally solve such problems is not acceptable. As a result, there are two distinct methods to be used: a heuristic and a metaheuristics. The first result is a good solution, the second tries to improve the solution obtained previously by using algorithms based on different fields of science.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com