We consider multi-objective scheduling with a single machine and multiple vehicles.
The goal is to minimize vehicle delivery and total customer waiting time.
We propose a PD-NSGA-II algorithm for this NP-hard problem.
The performance of the algorithm is tested through random data.
It is shown that the algorithm can offer high-quality solutions in reasonable time.