Abstract Two artificial intelligence techniques, evolutionary algorithms and simulated annealing are proposed to search for solutions to machine scheduling problem and optimal design in manufacturing systems. The performance of each the techniques is studied and the results compared with these from conventional methods. Evolutionary algorithms are computer-based problem-solving systems based on principles of evolutionary theory. A variety of evolutionary algorithms have been developed and they all share a common conceptual base of simulating the evolution of individual structures via processes of selection, mutation and recombination. The processes depend on the perceived performance of the individual structures as defined by an environment. One of the most popular evolutionary algorithms is genetic algorithm. Simulated annealing is an intelligent approach designed to give a good though not necessarily optimal solution, within a reasonable computation time. The motivation for simulated annealing comes from an analogy between the physical annealing of solid materials and optimization problem. This paper presents a general purpose schedule optimizer for manufacturing shop scheduling using genetic algorithms and the optimal design of inspection station in manufacturing systems by genetic algorithms and simulated annealing techniques. Then, a novel general effect of mutation rate on minimized objective value are presented. The task is to determine the optimal settings of the production parameters to minimize a cost function.
[1]
Paul R. Drake,et al.
NETWORK PLANNING USING ITERATIVE IMPROVEMENT METHODS AND HEURISTIC TECHNIQUES
,
2002
.
[2]
Emile H. L. Aarts,et al.
Simulated Annealing: Theory and Applications
,
1987,
Mathematics and Its Applications.
[3]
Tzvi Raz,et al.
Location and sequencing of imperfect inspection operations in serial multi-stage production systems
,
1991
.
[4]
R. A. Dudek,et al.
A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
,
1970
.
[5]
Sushil K. Gupta,et al.
Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
,
1990
.
[6]
D. E. Goldberg,et al.
Genetic Algorithm in Search
,
1989
.
[7]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[8]
Nikos E. Mastorakis,et al.
Advances in scientific computing, computational intelligence and applications
,
2001
.
[9]
M. Omizo,et al.
Modeling
,
1983,
Encyclopedic Dictionary of Archaeology.
[10]
Edem O. P. Akpan.
Job‐shop sequencing problems via network scheduling technique
,
1996
.
[11]
Peng Tian,et al.
An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
,
1993
.
[12]
A. SADEGHEIH.
Network Optimisation using Linear Programming and Genetic Algorithm
,
.