Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems

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

zbMATH Keywords

schedulingmetaheuristicstabu searchvariable neighbourhood searchcompromise solutionsmultiple-objective combinatorial optimization

Mathematics Subject Classification ID

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

Bi-objective optimisation model for installation scheduling in offshore wind farms ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ Variable neighbourhood search: methods and applications ⋮ Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm ⋮ Solving real car sequencing problems with ant colony optimization ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ Variable neighbourhood search: Methods and applications ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems