6533b835fe1ef96bd129f2ee
RESEARCH PRODUCT
Best compromise solution for a new multiobjective scheduling problem
Anne Setämaa-kärkkäinenJ. VuoriKaisa Miettinensubject
Mathematical optimizationGeneral Computer ScienceJob shop schedulingWireless networkComputer scienceModeling and SimulationManagement Science and Operations ResearchService providerTransmission timeMulti-objective optimizationTelecommunications networkAssignment problemScheduling (computing)description
In future wireless networks, a mobile terminal will be able to communicate with a service provider using several network connections. These connections to networks will have different properties and they will be priced separately. In order to minimize the total communication time and the total transmission costs, an automatic method for selecting the network connections is needed. Here, we describe the network connection selection problem and formulate it mathematically. We discuss solving the problem and analyse different multiobjective optimization approaches for it.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2006-08-01 | Computers & Operations Research |