The variable neighborhood search for the two machine flow shop problem with a passive prefetch
From MaRDI portal
Publication:5263790
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
Cited in
(11)- A bilevel planning model for public-private partnership
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
- 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
- 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)
