Publication | Closed Access

A hybrid Jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths

Mathematical ProgrammingJob SchedulerEngineeringScheduling ProblemFlexible Job ShopHybrid Jaya AlgorithmProduction SchedulingSystems EngineeringLogisticsScheduling (Production Processes)Vehicle Routing ProblemMultiple Critical PathsCombinatorial OptimizationOperations Research