Heuristic for a New Multiobjective Scheduling Problem
2007 (English)In: Optimization Letters, ISSN 1862-4472, Vol. 1, no 3, 213-225 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2007. Vol. 1, no 3, 213-225 p.
Heuristics - Parallel machine scheduling - Biobjective optimization - Combinatorial optimization - Telecommunications
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-83551DOI: 10.1007/s11590-006-0020-7ISI: 000261234100001OAI: oai:DiVA.org:kth-83551DiVA: diva2:498834
QC 201202272012-02-122012-02-122012-02-27Bibliographically approved