Publication | Closed Access

The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies

Mathematical ProgrammingEngineeringTwo-machine FlowshopScheduling AnalysisScheduling ProblemProduction SchedulingSystems EngineeringComputational ComplexityLogisticsScheduling (Computing)Computer ScienceParallel ComputingCombinatorial OptimizationSequence-independent Setup TimesOperations Research