Pages that link to "Item:Q5263790"
From MaRDI portal
The following pages link to The variable neighborhood search for the two machine flow shop problem with a passive prefetch (Q5263790):
Displayed 10 items.
- A bilevel planning model for public-private partnership (Q276164) (← links)
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- Two-machine flow shops with an optimal permutation schedule under a storage constraint (Q2197318) (← links)
- A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732) (← links)
- Local search for load balancing problems for servers with large dimension (Q2399466) (← links)
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
- Local search with an exponential neighborhood for the servers load balancing problem (Q5264767) (← links)
- Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915911) (← links)
- Hybrid variable neighborhood search for automated warehouse scheduling (Q6063514) (← links)
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine (Q6084515) (← links)