A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling

DOI10.1080/00207540902998349zbMath1197.90321OpenAlexW2154712077MaRDI QIDQ3163193

J. Behnamian, Seyyed Mohammad Taghi Fatemi Ghomi, Mostafa Zandieh

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540902998349

zbMATH Keywords

sequence-dependent setup timeshybrid metaheuristicmulti-objective optimisationparallel machines schedulingPareto optimum solutiondue window schedulingPareto covering

Mathematics Subject Classification ID

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

Related Items (3)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ A bi-objective aggregate production planning problem with learning effect and machine deterioration: modeling and solution ⋮ A united search particle swarm optimization algorithm for multiobjective scheduling problem

Cites Work

• A survey of very large-scale neighborhood search techniques
• Variable neighborhood search for the maximum clique
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• A genetic algorithm methodology for complex scheduling problems
• Minimizing the sum of job earliness and tardiness in a multimachine system
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search

This page was built for publication: A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling