Pages that link to "Item:Q1310012"

The following pages link to Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012):

Displaying 16 items.

• Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
• FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
• Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
• Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
• A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
• Using genetic algorithms for single-machine bicriteria scheduling problems (Q1869489) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm (Q2433464) (← links)
• Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
• Simulated annealing and genetic algorithms for scheduling products with multi-level product structure (Q2563875) (← links)
• A genetic algorithm-based approach to cell composition and layout design problems (Q4230071) (← links)
• Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm (Q5690288) (← links)
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)