Y. Deepa

According to our database, Y. Deepa authored at least 1 paper in 2009.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2009

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