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

zbMATH Open1183.90187MaRDI QIDQ3641997FDOQ3641997

Authors: Xue-mei Qi, Qian Wang, Xiaoping Li 

Publication date: 11 November 2009

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

zbMATH Keywords

heuristic algorithmtabu searchtotal flowtimepermutation flow shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• New block properties for the permutation flow shop problem with application in tabu search
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• An adaptive hybrid metaheuristic for permutation flowshop scheduling
• 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

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)