New block properties for the permutation flow shop problem with application in tabu search

DOI10.1057/palgrave.jors.2601055zbMath1131.90359OpenAlexW2014330046MaRDI QIDQ4658399

Jaroslaw Pempera, Jozef Grabowski

Publication date: 16 March 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.2601055

zbMATH Keywords

heuristicstabu searchsequencing

Mathematics Subject Classification ID

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

Related Items (12)

A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion ⋮ Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ Carbon-efficient scheduling of flow shops by multi-objective optimization ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ A unified framework for population-based metaheuristics ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ Open shop cyclic scheduling ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ An exact block algorithm for no-idle RPQ problem ⋮ Some aspects of scatter search in the flow-shop problem

This page was built for publication: New block properties for the permutation flow shop problem with application in tabu search