A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
From MaRDI portal
Publication:340272
DOI10.1016/j.cor.2012.08.021zbMath1349.90339OpenAlexW2119518778MaRDI QIDQ340272
Houkuan Huang, Ping Chen, Xingye Dong, Maciek Nowak
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://ecommons.luc.edu/cgi/viewcontent.cgi?article=1000&context=business_facpubs
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ An efficient local search algorithm for minimum positive influence dominating set problem ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS
This page was built for publication: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
