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.

• A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time (Q340272) (← links)
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
• Improving the anytime behavior of two-phase local search (Q408982) (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Reducing network and computation complexities in neural based real-time scheduling scheme (Q632870) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← links)
• Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• Shifting representation search for hybrid flexible flowline problems (Q992723) (← links)
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
• Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study (Q1652149) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
• A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)