Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs. - N. Madhushini; Chandrasekharan Rajendran; Y. Deepa (J. Oper. Res. Soc., 2009)