Pages that link to "Item:Q954039"
From MaRDI portal
The following pages link to A memetic algorithm for the flexible flow line scheduling problem with processor blocking (Q954039):
Displaying 12 items.
- Scheduling open shops with parallel machines to minimize total completion time (Q609214) (← links)
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- The effect of various parameters of solution methodology on a flexible integrated supply chain model (Q1721147) (← links)
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
- A comparison between memetic algorithm and genetic algorithm for an integrated logistics network with flexible delivery path (Q2241315) (← links)
- The hybrid flow shop scheduling problem (Q2270289) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study (Q2404310) (← links)
- Flexible job shop scheduling with blockages (Q2454071) (← links)
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design (Q2655961) (← links)
- AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS (Q2911573) (← links)
