Pages that link to "Item:Q2345864"

The following pages link to Polynomial-time local-improvement algorithm for consecutive block minimization (Q2345864):

Displaying 8 items.

• Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints (Q2184054) (← links)
• Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
• Heuristic methods to consecutive block minimization (Q2664289) (← links)
• Iterated local search for consecutive block minimization (Q2668701) (← links)
• Methods of local search for a problem on the permutation of the columns of a binary matrix (Q2895861) (← links)
• Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
• Exponential neighborhood search for consecutive block minimization (Q6082185) (← links)
• Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machines (Q6551111) (← links)