Publication | Closed Access

Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows

Mathematical ProgrammingDiscrete LotsizingEngineeringScheduling ProblemTravelling Salesman ProblemTraveling Salesman ProblemCombinatorial ProblemLogisticsComputational ComplexityComputer ScienceVehicle Routing ProblemDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingOperations Research