Pages that link to "Item:Q2333145"
From MaRDI portal
The following pages link to A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145):
Displaying 11 items.
- An exact solution method for multi-manned disassembly line design with and/or precedence relations (Q821861) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem (Q2669530) (← links)
- Optimization for cooperative task planning of heterogeneous multi-robot systems in an order picking warehouse (Q6048044) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)