Best compromise solution for a new multiobjective scheduling problem (Q2489291): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2005.02.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2005.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037301037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ancient and new algorithms for load balancing in the \(\ell_p\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristics for two-stage flow shop problems with secondary criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with a secondary criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2005.02.006 / rank
 
Normal rank

Latest revision as of 23:43, 18 December 2024

scientific article
Language Label Description Also known as
English
Best compromise solution for a new multiobjective scheduling problem
scientific article

    Statements

    Best compromise solution for a new multiobjective scheduling problem (English)
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    Multiobjective optimization
    0 references
    Biobjective optimization
    0 references
    Assignment problem
    0 references
    Parallel machine scheduling
    0 references
    Telecommunications
    0 references
    Wireless networks
    0 references

    Identifiers