Pages that link to "Item:Q1410624"
From MaRDI portal
The following pages link to Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624):
Displaying 26 items.
- A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic (Q709121) (← links)
- 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)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- An efficient binary gradient-based optimizer for feature selection (Q1984140) (← links)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← 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)
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters (Q2676401) (← links)
- An adaptive hybrid metaheuristic for permutation flowshop scheduling (Q2731683) (← links)
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems (Q2911576) (← links)
- Heuristic algorithms for continuous flow-shop problem (Q3489781) (← links)
- Incorporating preventive maintenance into the <i>m</i>-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study (Q5058979) (← links)
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
