Pages that link to "Item:Q1926908"

The following pages link to Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908):

Displaying 31 items.

• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time (Q340272) (← links)
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
• Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period (Q887888) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems (Q1725606) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
• Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• A local search method for permutation flow shop scheduling (Q3433488) (← links)
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
• Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem (Q5058781) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• Local search approaches for the test laboratory scheduling problem with variable task grouping (Q6090219) (← links)