New heuristics for flow shop problem to minimize makespan
From MaRDI portal
Publication:4933629
DOI10.1057/jors.2009.44zbMath1196.90045OpenAlexW2055528540MaRDI QIDQ4933629
Publication date: 14 October 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.44
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates ⋮ Optimal results and numerical simulations for flow shop scheduling problems ⋮ A local search algorithm for the flow shop scheduling problem with release dates
This page was built for publication: New heuristics for flow shop problem to minimize makespan
