Journal
OPTIMIZATION LETTERS
Volume 1, Issue 3, Pages 213-225Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-006-0020-7
Keywords
Heuristics; Parallel machine scheduling; Biobjective optimization; Combinatorial optimization; Telecommunications
Funding
- GETA graduate schoo
Ask authors/readers for more resources
We consider a telecommunication problem in which the objective is to schedule data transmission to be as fast and as cheap as possible. The main characteristic and restriction in solving this multiobjective optimization problem is the very limited computational capacity available. We describe a simple but efficient local search heuristic to solve this problem and provide some encouraging numerical test results. They demonstrate that we can develop a computationally inexpensive heuristic without sacrificing too much in the solution quality.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available