An effective heuristic algorithm for the partial shop scheduling problem
From MaRDI portal
Publication:1652579
DOI10.1016/j.cor.2018.01.015zbMath1391.90334MaRDI QIDQ1652579
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.015
heuristic; open shop scheduling; iterated tabu search; group shop scheduling; mixed shop scheduling; partial shop scheduling
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Uses Software