Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Job Shop Scheduling with Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Anticipation in Dynamic Optimization: The Scheduling Case
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
Journal of Scheduling
Production scheduling and rescheduling with genetic algorithms
Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Genetic algorithm and local search for just-in-time job-shop scheduling
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Dynamic scheduling of emergency department resources
Proceedings of the 1st ACM International Health Informatics Symposium
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Hi-index | 0.01 |
This paper deals with a two-objective rescheduling problem in a job shop for alteration of due date. One objective of this problem is to minimize the total tardiness, and the other is to minimize the difference of schedule. A genetic algorithm is proposed, and a new selection operation is particularly introduced to obtain the Pareto optimal solutions in the problem. At every generation in the proposed method, two solutions are picked up as the parents. While one of them is picked up from the population, the other is picked up from the archive solution set. Then, two solutions are selected from these parents and four children generated by means of the crossover and the mutation operation. The candidates selected are not only solutions close to the Pareto-optimal front but also solutions with a smaller value of the total tardiness, because the initial solutions are around the solution in which the total tardiness is zero. For this purpose, the solution space is ranked on the basis of the archive solutions. It is confirmed from the computational result that the proposed method outperforms other methods.