Publication | Closed Access

A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots

Production PlanningSequencing ProblemEngineeringData ScienceIndustrial EngineeringScheduling ProblemProduction SchedulingBusinessSystems EngineeringLogisticsNear-optimal HeuristicMultiple-batch Flow-shopsSupply Chain ManagementScheduling (Production Processes)Combinatorial OptimizationQuantitative ManagementOperations Research