Scatter search with path relinking for the flexible job shop scheduling problem

DOI10.1016/j.ejor.2015.02.052zbMath1346.90348OpenAlexW1995048221MaRDI QIDQ319521

Ramiro Varela, Camino R. Vela, Miguel A. González

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.02.052

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling ⋮ Shop scheduling in manufacturing environments: a review ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria ⋮ Metaheuristics for the online printing shop scheduling problem ⋮ A fine-grained parallel algorithm for the cyclic flexible job shop problem ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs

This page was built for publication: Scatter search with path relinking for the flexible job shop scheduling problem