Publication | Closed Access

An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem

Mathematical ProgrammingTotal TardinessEngineeringScheduling ProblemProduction SchedulingSystems EngineeringLogisticsDistributed Flowshop GroupScheduling (Production Processes)Scheduling (Computing)Combinatorial OptimizationDiscrete OptimizationEffective Two-stageOperations Research