Sciweavers

1292 search results - page 75 / 259
» Revisiting the optimal scheduling problem
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 1 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
EVOW
2000
Springer
15 years 3 months ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
ENDM
2010
100views more  ENDM 2010»
14 years 12 months ago
Large-scale multi-period precedence constrained knapsack problem: A mining application
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
DAC
2006
ACM
16 years 25 days ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
VLSI
2005
Springer
15 years 5 months ago
Combined Test Data Selection and Scheduling for Test Quality Optimization under ATE Memory Depth Constraint
1 The increasing test data volume required to ensure high test quality when testing a System-on-Chip is becoming a problem since it (the test data volume) must fit the ATE (Automa...
Erik Larsson, Stina Edbom