Heuristic for a new multiobjective scheduling problem

DOI10.1007/s11590-006-0020-7zbMath1152.90467OpenAlexW2127762137WikidataQ109314955 ScholiaQ109314955MaRDI QIDQ2463826

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

Publication date: 6 December 2007

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-006-0020-7

zbMATH Keywords

heuristicscombinatorial optimizationtelecommunicationsparallel machine schedulingbiobjective optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Scheduling jobs with truncated exponential learning functions ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time ⋮ A new complexity result on multiobjective linear integer programming using short rational generating functions ⋮ Single-machine scheduling with nonlinear deterioration ⋮ Minimizing makespan in a two-machine flow shop with effects of deterioration and learning ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times

Uses Software

• CPLEX

Cites Work

• Multiple and bicriteria scheduling: A literature survey
• Nonlinear multiobjective optimization
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Experiments with classification-based scalarizing functions in interactive multiobjective optimization
• Best compromise solution for a new multiobjective scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Multiple Variable-Speed Machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristic for a new multiobjective scheduling problem