Results 11 - 20 of 105,570

Table 1. Types of job-shop scheduling problems

in Heuristic Methods for Solving Job-Shop Scheduling Problems
by unknown authors
"... In PAGE 5: ... Design of the data test We have defined four types of job-shop scheduling problems. Each type has a different number of jobs, operations and resources (see Table1 ). We have randomly generated 50 problems of each type.... ..."

Table 2. Job Shop Scheduling Results with the BAS and the Petri Net algorithms.

in
by Gonzalo Mejía, Ph. D. Eliécer Gutiérrez, M. Sc. Andrés, L. Medaglia, Ph. D 2006
"... In PAGE 10: ...the Petri-Net models consisted of 220 places and 200 transitions. A summary of the results is shown in Table2 . Notice that both algorithms show competitive results in terms of solution quality and CPU times.... ..."

Table 15.2: Multi-population Results. The rst two columns use mutation, the second two do not Ring Architecture Multi-population Runs

in The Royal Tree Problem, a Benchmark for Single and Multi-population Genetic Programming
by Appears In, Kim Kinnear, Bill Punch, Doug Zongker, Erik Goodman

Table 1: Performance Measures for Job-shop Scheduling and Control

in unknown title
by unknown authors 2001
"... In PAGE 2: ... Our distributed, evolutionary approach to scheduling avoids these problems by removing the requirement for a truly optimal solution, requiring instead only a towards-optimal (but practical and useful) solution. The goal is to optimize (often) conflicting local and global performance measures (French, 1983), as outlined in columns one and two of Table1 . A secondary goal is to minimize the variance in the global stability measures in column three, in order to maximize the stability of the system.... ..."
Cited by 1

Table 2: Job Shop Problem

in SCHEDULING BATCH PROCESSING MACHINES IN COMPLEX JOB SHOPS
by B. A. Peters, J. S. Smith, D. J. Medeiros, M. W. Rohrer
"... In PAGE 5: ... Therefore, the job shop problem is modified into a flexible flow shop prob- lem using dummy nodes to fill in the space in the matrix where a particular step is not included in a particular job route. Table2 and 3 show an example how a complex job shop problem can be modified into a flexible flow shop problem. Each step has an associated TG type and a recipe name.... ..."

Table 4. The function and terminal set for job shop problem

in L.: Dynamic scheduling with genetic programming
by Domagoj Jakobović, Leo Budin
"... In PAGE 10: ... The other two parts (scheduling trees) are applied depending on the result of the decision tree. Scheduling trees use the same primitives as in Table4 , but the decision tree should be able to recognize increased load on a machine with appropriate set of terminals. The terminals which can be used in the decision tree are presented in Table 6 (the functions are the same in all trees).... ..."
Cited by 1

Table 6. Comparisons of the approaches (Hybrid GA: genetic algorithm + local search; Hybrid VNS: iterated variable neighborhood search, and our approaches) on the problem. Hybrid GA Hybrid VNS Decomposition

in A Decomposition, Construction and Postprocessing Approach for a Specific Nurse Rostering Problem
by Peter Brucker, Rong Qu, Edmund Burke, Gerhard Post 2005
"... In PAGE 5: ...enalties are re-assigned and the descent local search is started again. See [10] for more details. Using the decomposition, construction and post-processing approach, we obtained a number of different schedules on the problem presented in Section 2. The best results out of 5 runs on each of the approaches, namely the hybrid genetic algorithm, the variable neighborhood search and our approach with and without the variable neighborhood search approach as the 3rd stage of post-processing, are presented in Table6 . The values in parentheses give the computational time of the corresponding approaches.... ..."
Cited by 3

Table 6. Comparisons of the approaches (Hybrid GA: genetic algorithm + local search; Hybrid VNS: iterated variable neighborhood search, and our approaches) on the problem. Hybrid GA Hybrid VNS Decomposition

in A Decomposition, Construction and Postprocessing Approach for a Specific Nurse Rostering Problem
by Peter Brucker, Rong Qu, Edmund Burke, Gerhard Post 2005
"... In PAGE 5: ...enalties are re-assigned and the descent local search is started again. See [10] for more details. Using the decomposition, construction and post-processing approach, we obtained a number of different schedules on the problem presented in Section 2. The best results out of 5 runs on each of the approaches, namely the hybrid genetic algorithm, the variable neighborhood search and our approach with and without the variable neighborhood search approach as the 3rd stage of post-processing, are presented in Table6 . The values in parentheses give the computational time of the corresponding approaches.... ..."
Cited by 3

Table 2. Job shop problem

in unknown title
by unknown authors

Table 3. Job shop problems.

in Benchmarks for Basic Scheduling Problems
by E. Taillard
Results 11 - 20 of 105,570