Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime

MaRDI QIDQ3641997zbMATH OpenFDO

Authors Xue-mei Qi, Qian Wang, Xiaoping Li

Publication date 11 November 2009

zbMATH Keywords

heuristic algorithmtabu searchtotal flowtimepermutation flow shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A fast tabu search algorithm for the permutation flow-shop problem
• An adaptive hybrid metaheuristic for permutation flowshop scheduling
• A tabu search approach for the flow shop scheduling problem
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

Cited in

(6)

• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
• Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
• An adaptive hybrid metaheuristic for permutation flowshop scheduling
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• New block properties for the permutation flow shop problem with application in tabu search

This page was built for publication: Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3641997)