Pages that link to "Item:Q1410624"
From MaRDI portal
The following pages link to Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624):
Displayed 8 items.
- Looking ahead with the pilot method (Q816423) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680) (← links)