Pages that link to "Item:Q5945325"

The following pages link to Tabu search for a class of single-machine scheduling problems (Q5945325):

Displaying 17 items.

• Automatised selection of load paths to construct reduced-order models in computational damage micromechanics: from dissipation-driven random selection to Bayesian optimization (Q310267) (← links)
• A lower bound for weighted completion time variance (Q613431) (← links)
• Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
• Job scheduling methods for reducing waiting time variance (Q878584) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• Computational aspects of dispersive computational continua for elastic heterogeneous media (Q905049) (← links)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
• An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Second-order homogenization of periodic materials based on asymptotic approximation of the strain energy: formulation and validity limits (Q2510333) (← links)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times (Q3430247) (← links)
• Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)