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

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

Madhushini, N., (2009)

Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives

Madhushini, N., (2011)

A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop

Madhushini, N., (2012)