Approximating multi-objective scheduling problems

DOI10.1016/J.COR.2012.12.001MaRDI QIDQ502416zbMATH OpenOpenAlexFDO

Authors Said Dabia, El-Ghazali Talbi, Tom Van Woensel, Ton de Kok

Publication date 5 January 2017

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

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

zbMATH Keywords

\(\epsilon\)-dominanceapproximationdynamic programmingmulti-objective decisionsstate-dependent costs

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

Recommendations

• Multi-objective scheduling
• scientific article; zbMATH DE number 1830735
• Approximation methods for multiobjective and parametric optimization problems
• Approximating multiobjective knapsack problems
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.

Cited in

(10)

• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
• Multi-objective stochastic scheduling of job ready times
• Multi-objective dynamic programming with limited precision
• Heuristic for a new multiobjective scheduling problem
• Efficiency and equity in the multi organization scheduling problem
• scientific article; zbMATH DE number 592649 (Why is no real title available?)
• Multi-objective scheduling
• Approximately Supermodular Scheduling Subject to Matroid Constraints
• scientific article; zbMATH DE number 6263315 (Why is no real title available?)
• Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems

This page was built for publication: Approximating multi-objective scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502416)