17 search results - page 3 / 4 » Extending Systematic Local Search for Job Shop Scheduling Pr... |
261
click to vote
ESWA
2008
15 years 3 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
122
click to vote
AAAI
2000
15 years 4 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
160
click to vote
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able...
113
click to vote
MICRO
1990
IEEE
15 years 7 months ago
1990
IEEE
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...
112
click to vote
AI
2003
Springer
15 years 8 months ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...