In this study, the problem of scheduling a set of jobs and one uncertain maintenance activity on a single machine, with the objective of minimizing the makespan is addressed. The maintenance activity has a given duration and must be executed within a given time window. Furthermore, duration and...

HighlightsOrder aggregation and scheduling in a meal delivery problemAlessandro Agnetis, Matteo Cosmi, Gaia Nicosia, Andrea Pacifici• A new model for scheduling single- or dual-order deliveries• A branch and bound algorithm makes use of sophisticated lower bounding schemes• Extensive...