908 search results - page 26 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
91
Voted
SCHEDULING
2008
15 years 1 months ago
2008
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
117
Voted
COR
2008
15 years 1 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
95
Voted
IPPS
1994
IEEE
15 years 6 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
119
Voted
TEC
2002
15 years 1 months ago
2002
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
123
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...