Best compromise solution for a new multiobjective scheduling problem
From MaRDI portal
Publication:2489291
Recommendations
- Heuristic for a new multiobjective scheduling problem
- Some analyses on a proposed method of the optimal network selection problem
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Multiobjective flow control in delay constrained telecommunication networks
- Optimization in wireless networks
Cites work
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- An approximation algorithm for the generalized assignment problem
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Local search heuristics for two-stage flow shop problems with secondary criterion
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications
- Multicriteria scheduling problems: a survey
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Nonlinear multiobjective optimization
- 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
- Two-machine flowshop scheduling with a secondary criterion
Cited in
(3)
This page was built for publication: Best compromise solution for a new multiobjective scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489291)