1292 search results - page 33 / 259 » Revisiting the optimal scheduling problem |
ICICIC
2006
IEEE
14 years 2 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
EOR
2008
13 years 8 months ago
2008
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
ATMOS
2010
13 years 7 months 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...
ESA
2006
Springer
14 years 4 days ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...