The variable neighborhood search for the two machine flow shop problem with a passive prefetch

DOI10.1134/S1990478913010067zbMATH Open1324.90061MaRDI QIDQ5263790FDOQ5263790

Authors: P. A. Kononova, Yury Kochetov 

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Recommendations

• Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
• Local search algorithms for the multiprocessor flow shop scheduling problem
• Flow-shop problems with intermediate buffers

zbMATH Keywords

local searchscheduling theoryexponential neighborhood

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cited In (11)

• A bilevel planning model for public-private partnership
• Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
• A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
• Local search with an exponential neighborhood for the servers load balancing problem
• Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
• On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
• A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
• Two-machine flow shops with an optimal permutation schedule under a storage constraint
• Local search for load balancing problems for servers with large dimension
• An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
• Hybrid variable neighborhood search for automated warehouse scheduling

This page was built for publication: The variable neighborhood search for the two machine flow shop problem with a passive prefetch

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