Publication | Closed Access

Efficient composite heuristics for total flowtime minimization in permutation flow shops☆

EngineeringTotal Flowtime MinimizationScheduling ProblemPermutation Flow Shops☆Computer EngineeringCombinatorial ProblemSystems EngineeringEfficient Composite HeuristicsComputer ScienceCombinatorial OptimizationDiscrete OptimizationHeuristic SearchOperations Research