Urban travelers today are seeking increasingly more information to plan their optimal trip, based on additional factors other than scheduled departure times. Still, some route planning applications provide a simple approach with a few parameter settings (e.g. to minimize travel time between two...

This paper presents branch-and-bound algorithms developed for an m-machine permutation flowshop to minimise the maximum weighted flowtime/maximum weighted tardiness/maximum sum of weighted flowtime and weighted tardiness/maximum sum of weighted flowtime, weighted tardiness and weighted earliness...