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...

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines with a regular criterion. Chain precedence constraints among the tasks, deterministic processing times and processing machine of each task are given.