908 search results - page 17 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
PKC
2010
Springer
13 years 8 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
ATMOS
2007
13 years 11 months ago
2007
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
PDPTA
2008
13 years 11 months ago
2008
- For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. ...
COR
2008
13 years 10 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...