Pages that link to "Item:Q1413816"
From MaRDI portal
The following pages link to New heuristics for no-wait flowshops to minimize makespan. (Q1413816):
Displaying 29 items.
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics (Q1776952) (← links)
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
- Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation (Q2287628) (← links)
- Processing element allocation and dynamic scheduling codesign for multi-function SoCs (Q2379860) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
- A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS (Q2911576) (← links)
- Minimizing total tardiness in no-wait flowshops (Q2978428) (← links)
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions (Q3509420) (← links)
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
- Heuristic for no-wait flow shops with makespan minimization (Q5385488) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)