908 search results - page 20 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
102
click to vote
EOR
2008
15 years 1 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
101
click to vote
ECAIW
2000
Springer
15 years 6 months ago
2000
Springer
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
146
Voted
CP
1998
Springer
15 years 6 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
123
click to vote
ICOIN
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...