### Citations

3545 |
Equation of state calculations by fast computing machines,’’
- Metropolis, Rosenbluth, et al.
- 1953
(Show Context)
Citation Context ...ons being accepted as current. The value T is referred to as the current temperature, and serves as a control parameter. The formula presented in (18) above is referred to as the Metropolis Criterion =-=[17]-=-. The important thing to understand here is that inferior new solutions are sometimes accepted to replace the current solution. At rst glance, this may seem destructive, but this is one of the feature... |

2704 |
Genetic algorithms + data structures = evolution programs (2nd, extended ed.).
- Michalewicz
- 1994
(Show Context)
Citation Context ...imal solutions to combinatorial optimization problems can be done via search heuristics. There are several search heuristics that have been popular tools in the literature, such as genetic algorithms =-=[8,9], -=-tabu search [10–12] and ant-colony optimization heuristics [13,14]. This particular e ort, however, exploits the popular search heuristic of simulated annealing [15,16]. Simulated annealing gets its... |

233 |
Genetic algorithm in search, optimization and machine learning.
- DE
- 1989
(Show Context)
Citation Context ...imal solutions to combinatorial optimization problems can be done via search heuristics. There are several search heuristics that have been popular tools in the literature, such as genetic algorithms =-=[8,9], -=-tabu search [10–12] and ant-colony optimization heuristics [13,14]. This particular e ort, however, exploits the popular search heuristic of simulated annealing [15,16]. Simulated annealing gets its... |

177 | A User's Guide to Tabu Search - Glover, Taillard, et al. - 1993 |

141 |
Theraulaz, Swarm Intelligence: From Natural to Artificial Systems
- Bonabeau, Dorigo, et al.
- 1999
(Show Context)
Citation Context ...via search heuristics. There are several search heuristics that have been popular tools in the literature, such as genetic algorithms [8,9], tabu search [10–12] and ant-colony optimization heuristic=-=s [13,14]. -=-This particular e ort, however, exploits the popular search heuristic of simulated annealing [15,16]. Simulated annealing gets its name from the physical annealing of solids—heating a solid to a ver... |

98 |
Gelatt CD, Vecchi MP. Optimization by simulated annealing
- Kirkpatrick
- 1983
(Show Context)
Citation Context ...ure, such as genetic algorithms [8,9], tabu search [10–12] and ant-colony optimization heuristics [13,14]. This particular e ort, however, exploits the popular search heuristic of simulated annealin=-=g [15,16]. Si-=-mulated annealing gets its name from the physical annealing of solids—heating a solid to a very high temperature and then slowly cooling the solid. During the cooling, the solid’s particles rearra... |

32 | Tabu search: a tutorial. Interfaces - Glover - 1990 |

16 |
Applied multivariate statistical analysis. 3rd edition
- RA, DW
- 1992
(Show Context)
Citation Context ....1. Canonical correlation and Wilks’ Lambda Canonical correlation is the exploration of the relationship between two sets of variables—each of the two sets of variables can contain multiple variab=-=les [6]-=-. Canonical correlation is used here to explore the relationship between the set of tool-wear variables (yi variables) and the lagged set of variables (xi variables). Since Table 2 shows an unbalanced... |

14 |
An effective mixed-model assembly line sequencing heuristic for Just-in-Time production systems
- Ding, Cheng
- 1993
(Show Context)
Citation Context ...quirements for the demand of raw materials. This approach to sequencing is very important to manufacturing rms having an interest in just-in-time (JIT) production. Asequence optimizing the usage rate =-=[19] f-=-or this simple sequencing problem is as follows: AB AC AB A(minimized usage rate):sP.R. McMullen et al. / Computers & Operations Research 30 (2003) 443–462 455 Some consider minimization of this usa... |

12 |
A note on the generation of random normal deviates
- GEP, ME
- 1958
(Show Context)
Citation Context ...r this research, the coe cient of variation (cv) is always set to 0.15. Also, the value of z is a random normal deviate sampled from a population having a mean of zero and a standard deviation of one =-=[20]-=-. After each product-set is processed by the m tooling areas, the depletion of tooling is accounted for via (20) and (21). If the level of tooling is less than the lower threshold value, the tooling i... |

9 |
Simulated annealing: A tool for operational research
- RW
(Show Context)
Citation Context ...ure, such as genetic algorithms [8,9], tabu search [10–12] and ant-colony optimization heuristics [13,14]. This particular e ort, however, exploits the popular search heuristic of simulated annealin=-=g [15,16]. Si-=-mulated annealing gets its name from the physical annealing of solids—heating a solid to a very high temperature and then slowly cooling the solid. During the cooling, the solid’s particles rearra... |

7 |
Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups
- McMullen, Tarasewich, et al.
- 2000
(Show Context)
Citation Context ...cing, there are then n! possible permutations. If there are n1 units of product-set 1, n2 units of product-set 2;::: nk units of product-set k, there are the following number of possible permutations =-=[7]: ��-=-k i=1 Possible Permutations = ni � ! �k i=1 ni! : (17) One quickly realizes, then, that nding the best sequence for larger problems via enumeration becomes quite di cult if not outright impossible... |

4 |
schedules for mixed-model assembly lines in just-in-time production systems
- Level
- 1989
(Show Context)
Citation Context ...inimized makespan): This of course, can be done by inspection. The other of the two additional approaches to sequencing is the sequence that optimizes (minimizes) the stability of material usage rate =-=[18]-=-. This approach attempts to nd sequences that maximize system exibility and evenly distribute the requirements for the demand of raw materials. This approach to sequencing is very important to manufac... |

3 | Cutting tools versus machine tools investments - Barad, Hoang - 1995 |

2 |
Development of computer-aided machining optimization for multi-pass rough turning operations
- PK
- 1994
(Show Context)
Citation Context ...en little work done with regard to the scheduling of systems when the minimization of tool replacement is a priority. Aliterature search has uncovered work involved with e cient tooling and machining =-=[1,2], -=-and with e cient replacement of tooling [3–5], but nothing involving scheduling with the intent of prolonging the life of the tool. If production is scheduled in a way that results in prolonging the... |

2 |
Amultipass optimization strategy for CNC lathe operations
- SH
- 1995
(Show Context)
Citation Context ...en little work done with regard to the scheduling of systems when the minimization of tool replacement is a priority. Aliterature search has uncovered work involved with e cient tooling and machining =-=[1,2], -=-and with e cient replacement of tooling [3–5], but nothing involving scheduling with the intent of prolonging the life of the tool. If production is scheduled in a way that results in prolonging the... |

2 | Tanchoco JMA. Multiple machine replacement analysis - LC - 1990 |

2 | Replacement analysis for components of large scale production systems - JT - 2003 |

2 | Tabu search and design optimization. Computer Aided Design - JA, GP - 1991 |

1 |
Theraulaz G. Swarm smarts. Scienti c
- Bonabeau
(Show Context)
Citation Context ...via search heuristics. There are several search heuristics that have been popular tools in the literature, such as genetic algorithms [8,9], tabu search [10–12] and ant-colony optimization heuristic=-=s [13,14]. -=-This particular e ort, however, exploits the popular search heuristic of simulated annealing [15,16]. Simulated annealing gets its name from the physical annealing of solids—heating a solid to a ver... |

1 |
Numerical methods using Matlab, 3rd ed. Englewood Cli s, NJ: Prentice-Hall
- JH, Fink
- 1999
(Show Context)
Citation Context ...values of the characteristic matrix required for the ultimate Wilks’ Lambda calculation. Numerical iteration via the Jacobi method is used here to capture the eigensystems of the appropriate matrice=-=s [22]. -=-The sum of pairwise correlation measure is about four times more CPU intensive than the gap measure approach—correlations are calculated, but there are no matrix manipulations required. The gap meas... |