908 search results - page 18 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
130
Voted
ATMOS
2010
15 years 23 days ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
108
Voted
MP
2006
15 years 1 months ago
2006
The vast size of real world stochastic programming instances requires sampling to make them practically solvable. In this paper we extend the understanding of how sampling affects ...
122
click to vote
CEC
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
115
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
CONSTRAINTS
2000
15 years 1 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...