Contents & References of Production planning and control system on the factory floor using the cooperation of intelligent agents to achieve mass customization
List:
Chapter 1: Introduction. 5
1-1- Introduction. 6
1-2- Research innovations. 7
1-3- Structure of thesis. 7
Chapter 2: Customization in mass production. 9
2-1- Introduction. 10
2-2- Customization levels. 12
2-3- Capabilities needed to implement customization in mass production 16
2-5- Summary and conclusion. 18
Chapter 3: Planning and scheduling. 19
3-1- Introduction. 20
3-2- Production system modeling in planning and scheduling. 21
3-3- Works, machines and workshops 24
3-4- Performance criteria in production scheduling. 28
3-5- Mathematical modeling of flexible workshop scheduling problem. 32
3-6- Research background in the field of flexible workshop scheduling. 35
3-7- Summary and conclusion. 37
Chapter 4: meta discoveries in optimization. Error! Bookmark not defined.
4-1- Introduction. 80
4-2- Basic definitions. 80
4-3- Route-based methods. 85
4-4- exploratory local search methods. 92
4-5- Population-based methods. 97
4-6- Summary and conclusion. 107
Chapter 5: Multi-objective optimization with collective motion of particles. 40
5-1- Introduction. 41
5-5- Summary and conclusion. 61
Chapter 6: Application of DbMOPSO in flexible workshop planning and scheduling. 63
6-1- Introduction. 64
6-2- Search space. 65
6-3- Issues to be investigated. 66
6-4- Simulation results. 71
6-6- Summary and conclusion. 75
Chapter 7: Summary and conclusion. 76
7-1- Introduction. 77
7-2- Research achievements. 77
3-7- Axis of further study and expansion. 78
References. 109
Table 1-2: General customization levels
15
Table 6-1: Execution times of the operations related to sample problem 1
95
Table 2-6: Operation execution times related to problem example 2
96
Table 6-3: Operation execution times related to problem example 3
97
Table 6-4: Operation execution times related to problem example 4
98
Table 6-5: Objective function values ??of solutions obtained for example problem 1 by Kasem and Colleagues
100
Table 6-6: The values ??of the objective functions of the solutions obtained for the sample problem 1 using the DbMOPSO algorithm
100
Table 6-7: The values ??of the objective functions of the solutions obtained for the sample problem 2 by Kasem et al.
101
Table 6-8: The values ??of the objective functions of the solutions obtained for the sample problem 2 Using the DbMOPSO algorithm
101
Table 6-9: Values ??of the objective functions of the solutions obtained for sample problem 3 by Kasem et al.
102
Table 6-10: Values ??of the objective functions of the solutions obtained for the sample problem 3 using the DbMOPSO algorithm
102
Table 6-11: Values The objective functions of the solutions obtained for sample problem 4 by Kasem et al. 103 Table 6-12: Values ??of the objective functions of the solutions obtained for sample problem 4 using the DbMOPSO algorithm 103 Production
23
Figure 4-1: Iterative improvement algorithm
46
Figure 4-2: Simulated fusion algorithm
46
Figure 4-3: Guided local search idea
54
Figure 4-4: An arbitrary step of ILS
56
Figure 4-5: The general format of evolutionary computing algorithms
58
Figure 4-6: The general format of the collective movement algorithm of particles
65
Figure 5-1: The concept of Pareto optimal solution
70
Figure 5-2: Showing the concept of dominance in the goal space
71
Figure 5-3: Showing the Pareto Optimal Front in Objective space
72
Figure 5-4: DbMOPSO algorithm
76
Figure 5-5: Result of NSGA II algorithm in solving sample problem 1
78
Figure 5-6: Result of PAES algorithm in solving sample problem 1
78
Figure 5-7: Result of algorithm MOPSO in solving sample problem 1
79
Figure 5-8: The result of the algorithm109
Table 1-2: General customization levels
15
Table 6-1: Execution times of the operations related to sample problem 1
95
Table 2-6: Operation execution times related to problem example 2
96
Table 6-3: Operation execution times related to problem example 3
97
Table 6-4: Operation execution times related to problem example 4
98
Table 6-5: Objective function values ??of solutions obtained for example problem 1 by Kasem and Colleagues
100
Table 6-6: The values ??of the objective functions of the solutions obtained for the sample problem 1 using the DbMOPSO algorithm
100
Table 6-7: The values ??of the objective functions of the solutions obtained for the sample problem 2 by Kasem et al.
101
Table 6-8: The values ??of the objective functions of the solutions obtained for the sample problem 2 Using the DbMOPSO algorithm
101
Table 6-9: Values ??of the objective functions of the solutions obtained for sample problem 3 by Kasem et al.
102
Table 6-10: Values ??of the objective functions of the solutions obtained for the sample problem 3 using the DbMOPSO algorithm
102
Table 6-11: Values The objective functions of the solutions obtained for sample problem 4 by Kasem et al. 103 Table 6-12: Values ??of the objective functions of the solutions obtained for sample problem 4 using the DbMOPSO algorithm 103 Production
23
Figure 4-1: Iterative improvement algorithm
46
Figure 4-2: Simulated fusion algorithm
46
Figure 4-3: Guided local search idea
54
Figure 4-4: An arbitrary step of ILS
56
Figure 4-5: The general format of evolutionary computing algorithms
58
Figure 4-6: The general format of the collective movement algorithm of particles
65
Figure 5-1: The concept of Pareto optimal solution
70
Figure 5-2: Showing the concept of dominance in the goal space
71
Figure 5-3: Showing the Pareto Optimal Front in Objective space
72
Figure 5-4: DbMOPSO algorithm
76
Figure 5-5: Result of NSGA II algorithm in solving sample problem 1
78
Figure 5-6: Result of PAES algorithm in solving sample problem 1
78
Figure 5-7: Result of algorithm MOPSO in solving sample problem 1
79
Figure 5-8: The result of DbMOPSO algorithm in solving sample problem 1
79
Figure 5-9: The result of NSGA II algorithm in solving sample problem 2
81
Figure 5-10: The result of PAES algorithm in solving sample problem 2
81
Figure 5-11: The result of MOPSO algorithm in solving sample problem 2
82
Figure 5-12: The result of DbMOPSO algorithm in solving sample problem 2
82
Figure 5-13: The result of NSGA II algorithm in solving sample problem 3
84
Figure 5-14: The result of PAES algorithm in solving sample problem 3
84
Figure 5-15: The result of MOPSO algorithm in solving sample problem 3
85
Figure 5-16: The result of DbMOPSO algorithm in solving sample problem 3
85
Figure 5-17: The result of NSGA II algorithm in solving problem Example 4
87
Figure 5-18: The result of the PAES algorithm in solving the problem of example 4
87
Figure 5-19: The result of the MOPSO algorithm in solving the problem of example 4
88
Figure 5-20: The result of the DbMOPSO algorithm in solving the problem of example 4
88
Source:
References
A. Toffler, "Future shock," Bantam Books, 1970
A. Toffler, "The third wave," Bantam Books, 1980
A. Toffler, "Powershift: knowledge, wealth and violence at the edge of the 21st century," Bantam Books, 1990
S. Davis, "From future perfect: Mass customizing," Planning Review, vol. 17, no. 2, pp. 16-21, 1989
G. Da Silveira et al., "Mass customization: Literature review and research directions," Int. J. Production Economics, vol. 72, pp. 1-13, 2001
J. Gilmore, and J. Pine, "The four faces of mass customization," Harvard Business Review, vol. 75, no. 1, pp. 91-101, 1997
J. Pine, "Mass customizing products and services," Planning Review, vol. 21, no. 4, pp. 6-13, 1993
J. Spira, "Mass customization through training at Lutron Electronics," Computers in Industry, vol. 30, no. 3, pp. 171-174, 1996
M. Pinedo, "Planning and scheduling in manufacturing services," Springer, 2005
P. Bruker, and R. Schlie, "Job shop scheduling with multi-purpose machines," Computing, vol. 45, pp. 369–375, 1990
E. Hurink, B. Jurisch, and M. Thole, "Tabu search for the job shop scheduling problem with multi-purpose machines," Operations Research Spektrum, vol. 15, pp. 205-215, 1994
M. Mastrolloli, and L.M. Gambardella, "Effective neighborhood functions for the flexible job shop problem," Journal of Scheduling, vol. 3, no. 1, pp. 3-20, 2002
I. Kacem, S. Hammadi, and P. Borne, "Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic," Mathematics and Computers in Simulation, vol. 60, pp. 245–276, 2002
W. Xia, and Z. Wu, "An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems," Computers & Industrial Engineering, vol. 48, pp. 409–425, 2005
C. Blum, "Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison," ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003
I.H. OSMAN, and G. LAPORTE, "Metaheuristics: A bibliography," Ann. Operations Research, vol. 63, pp. 513–623, 1996
S. VO?, et. al., "Meta-Heuristics—Advances and Trends in Local Search Paradigms for Optimization," Kluwer Academic Publishers, 1999
METAHEURISTICS NETWORK WEBSITE, http://www.metaheuristics.net/, Visited in 2009
C. Coello, G. Pulido, and M. Lechuga, "Handling multiple objectives with particle swarm optimization," IEEE Trans. Evolutionary Computation, vol. 8, pp. 256-279, 2004
E. Zitzler, "Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications," Ph.D. thesis, Swiss Federal Institute of Technology Zurich, 1999
K. Deb, "Multi-objective genetic algorithms: problem difficulties and construction of test problems," Evolutionary Computation, vol. 7, no. 3, pp.