The variable neighborhood search for the two machine flow shop problem with a passive prefetch
From MaRDI portal
Publication:5263790
DOI10.1134/S1990478913010067zbMath1324.90061MaRDI QIDQ5263790
P. A. Kononova, Yury A. Kochetov
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Related Items
A bilevel planning model for public-private partnership, On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements, A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem, Local search for load balancing problems for servers with large dimension, Hybrid variable neighborhood search for automated warehouse scheduling, An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine, Two-machine flow shops with an optimal permutation schedule under a storage constraint, A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements, Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements, Local search with an exponential neighborhood for the servers load balancing problem
