Pages that link to "Item:Q5416771"
From MaRDI portal
The following pages link to An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771):
Displayed 10 items.
- A biased random-key genetic algorithm for the unequal area facility layout problem (Q319725) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- A biased random-key genetic algorithm for single-round divisible load scheduling (Q2806431) (← links)
- Improved heuristics for the regenerator location problem (Q5175825) (← links)
- Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems (Q6065134) (← links)
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls (Q6066301) (← links)
- Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem (Q6092543) (← links)