Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
From MaRDI portal
Publication:5464237
DOI10.1057/palgrave.jors.2601868zbMath1095.90120MaRDI QIDQ5464237
Marc Gravel, Wilson L. Price, Caroline Gagné
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
scheduling; metaheuristics; tabu search; variable neighbourhood search; compromise solutions; multiple-objective combinatorial optimization
90C29: Multi-objective and goal programming
90B40: Search theory
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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, Variable neighbourhood search: methods and applications, Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm, Variable neighbourhood search: Methods and applications, 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, A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times, Solving real car sequencing problems with ant colony optimization, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
