Pages that link to "Item:Q4979992"
From MaRDI portal
The following pages link to Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992):
Displayed 14 items.
- A multi-agent based cooperative approach to scheduling and routing (Q323308) (← links)
- On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs (Q1712070) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks (Q2140358) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
- Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem (Q2794677) (← links)
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times (Q5232502) (← links)
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility (Q6066586) (← links)
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains (Q6066639) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
- Research on <i>m</i>‐machine flow shop scheduling with truncated learning effects (Q6088136) (← links)
- An ILS heuristic for the ship scheduling problem: application in the oil industry (Q6088240) (← links)
