International audienceThis paper studies the scheduling problem within a logistic platform node. It corresponds to the last node in the supply chain located just before the final customers. In this node, customer orders are prepared using known quantities of components received from the suppliers. For upstream flows, trucks deliver known component quantities at fixed times. For downstream flows, optimized customer delivery tours are planned at fixed times except the last one which will be done at a flexible time corresponding to the end of the schedule. We consider a simplified case of one bottleneck-assembling machine. Several sub cases are considered depending on the number of the fixed and flexible deliveries and also on the chosen criteria. For each sub case, upper and lower bounds are proposed and compared experimentally on heterogeneous instance families. All the ingredients are therefore available to design a branch and bound for these new scheduling problems
