Sciweavers

38 search results - page 6 / 8
» Discrepancy search for the flexible job shop scheduling prob...
Sort
View
AAAI
1994
13 years 8 months ago
Case-Based Acquisition of User Preferences for Solution Improvement in Ill-Structured Domains
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
Katia P. Sycara, Kazuo Miyashita
ESWA
2010
175views more  ESWA 2010»
13 years 6 months ago
A multi-objective PSO for job-shop scheduling problems
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
D. Y. Sha, Hsing-Hung Lin
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 11 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
COR
2010
119views more  COR 2010»
13 years 7 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
AAAI
2000
13 years 8 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith