Pages that link to "Item:Q3489781"
From MaRDI portal
The following pages link to Heuristic algorithms for continuous flow-shop problem (Q3489781):
Displayed 22 items.
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- Total flowtime in no-wait flowshops with separated setup times. (Q1406685) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- New heuristics for no-wait flowshops to minimize makespan. (Q1413816) (← links)
- Stochastically minimizing total flowtime in flowshops with no waiting space (Q1806645) (← links)
- Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time (Q2475853) (← links)
- A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS (Q2911576) (← links)
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← 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)
- A new heuristic and dominance relations for no-wait flowshops with setups (Q5936136) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)