A local search method for permutation flow shop scheduling
From MaRDI portal
Publication:3433488
DOI10.1057/palgrave.jors.2602106zbMath1123.90080OpenAlexW2043827061MaRDI QIDQ3433488
Publication date: 30 April 2007
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.2602106
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Multi-neighborhood based path relinking for two-sided assembly line balancing problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ 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
