Best compromise solution for a new multiobjective scheduling problem

DOI10.1016/j.cor.2005.02.006zbMath1086.90027OpenAlexW2037301037WikidataQ109314959 ScholiaQ109314959MaRDI QIDQ2489291

Anne Setämaa-Kärkkäinen, Jarkko Vuori, Kaisa M. Miettinen

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.006

zbMATH Keywords

Assignment problemTelecommunicationsMultiobjective optimizationWireless networksBiobjective optimizationParallel machine scheduling

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Related Items

Heuristic for a new multiobjective scheduling problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear multiobjective optimization
• An approximation algorithm for the generalized assignment problem
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
• Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications
• Two-machine flowshop scheduling with a secondary criterion
• Multicriteria scheduling problems: a survey
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm
• Local search heuristics for two-stage flow shop problems with secondary criterion