Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
Publication:5464237
DOI10.1057/palgrave.jors.2601868zbMath1095.90120OpenAlexW1963506405MaRDI QIDQ5464237
Marc Gravel, Caroline Gagné, Wilson L. Price
Publication date: 17 August 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601868
schedulingmetaheuristicstabu searchvariable neighbourhood searchcompromise solutionsmultiple-objective combinatorial optimization
Multi-objective and goal programming (90C29) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
This page was built for publication: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems