Pages that link to "Item:Q300036"

The following pages link to New hard benchmark for flowshop scheduling problems minimising makespan (Q300036):

Displaying 32 items.

• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← 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 computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
• A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Makespan preserving flowshop reengineering via blocking constraints (Q2329711) (← links)
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
• \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
• Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
• An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
• On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
• Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
• Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users (Q6098953) (← links)