Lower and upper bounds for scheduling a real-life assembly problem with precedences and resource constraints
Abstract: Highlights•A real-life scheduling problem involving the production of off-road vehicles.•Human workers modelled as renoweable resources as in Porject Scheduling.•A directed rooted in-tree precedence structure.•A generalization of the precedence constrained Parallel Machine Scheduling with a global resource.•A generalization of the Flexible Flow Shop Problem.•Lower bounds, constructive heuristics based on classical priority rules, and on adaptations of job sequencing heuristics.•A specialized approach (CORE) tailored to leverage the problem structure.•Extensive computational results.
Loading