Publication | Closed Access

Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times

Mathematical ProgrammingMemetic AlgorithmEngineeringScheduling AnalysisIndustrial EngineeringDynamic TransportScheduling ProblemProduction SchedulingBusinessSystems EngineeringLogisticsScheduling (Production Processes)Vehicle Routing ProblemCombinatorial OptimizationTransportation EngineeringOperations Research