Best compromise solution for a new multiobjective scheduling problem

Authors:
Anne Setämaa-Kärkkäinen;Kaisa Miettinen;Jarkko Vuori
Affiliations:
Department of Mathematical Information Technology, FIN, University of Jyväskylä, Finland;Helsinki School of Economics, FIN Helsinki, Finland;Department of Mathematical Information Technology, FIN, University of Jyväskylä, Finland
Venue:
Computers and Operations Research
Year:
2006

Citing 10
Cited 3

Integer and combinatorial optimization

Integer and combinatorial optimization
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
Routing in the Internet

Routing in the Internet
Local search heuristics for two-stage flow shop problems with secondary criterion

Computers and Operations Research
Issues in Emerging 4G Wireless Networks

Computer
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines

Computers and Operations Research
Two-machine flowshop scheduling with a secondary criterion

Computers and Operations Research
Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
Always best connected

IEEE Wireless Communications

Optimal usage of multiple network connections

Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications
Fast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Fast multi-objective reschulding of grid jobs by heuristics and evolution

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.