Publication | Closed Access

A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion

Mathematical ProgrammingEngineeringScheduling ProblemComputer EngineeringProduction SchedulingLogisticsSystems EngineeringTotal Tardiness CriterionScheduling (Production Processes)Scheduling (Computing)Parallel ComputingCombinatorial OptimizationDiscrete OptimizationOperations Research