A local search method for permutation flow shop scheduling

DOI10.1057/PALGRAVE.JORS.2602106zbMATH Open1123.90080OpenAlexW2043827061MaRDI QIDQ3433488FDOQ3433488

Lei Wang, Wenqi Huang

Publication date: 30 April 2007

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602106

Recommendations

• A comparison of local search methods for flow shop scheduling
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• Local search methods for the flowshop scheduling problem with flowtime minimization
• An efficient local search for minimizing completion time variance in permutation flow shops
• Local search algorithms for the multiprocessor flow shop scheduling problem
• 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
• An iterated local search algorithm for the lot-streaming flow shop scheduling problem
• A local search algorithm for the flow shop scheduling problem with release dates

zbMATH Keywords

heuristicslocal searchflow shop sequencingescape-from-trap

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Cited In (7)

• A comparison of local search methods for flow shop scheduling
• Multi-neighborhood based path relinking for two-sided assembly line balancing problem
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Local search algorithms for the multiprocessor flow shop scheduling problem
• On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment

This page was built for publication: A local search method for permutation flow shop scheduling

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