Pages that link to "Item:Q857345"

The following pages link to A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345):

Displaying 50 items.

• The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
• Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect (Q1687634) (← links)
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
• Diversity controlling genetic algorithm for order acceptance and scheduling problem (Q1718199) (← links)
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) (← links)
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems (Q1761190) (← links)
• Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
• Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
• A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
• Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm (Q1793174) (← links)
• Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
• A hybrid differential evolution algorithm with column generation for resource constrained job scheduling (Q2003586) (← links)
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
• Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem (Q2030552) (← links)
• Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
• A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data (Q2070120) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
• Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches (Q2077989) (← 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)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
• Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
• Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
• Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
• A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)