Similar Search Results

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

Madhushini, N.; Rajendran, Chandrasekharan - In: European Journal of Industrial Engineering 5 (2011) 4, pp. 361-387

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...

Persistent link: https://www.econbiz.de/10009352917

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

Madhushini, N.; Rajendran, Chandrasekharan - In: European journal of industrial engineering : EJIE 5 (2011) 4, pp. 361-387

Persistent link: https://www.econbiz.de/10009489205

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

Madhushini, N.; Rajendran, Chandrasekharan - In: Technology operation management : TOM ; official … 3 (2012) 1/2, pp. 1-10

Persistent link: https://www.econbiz.de/10010248552

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

Madhushini, N.; Rajendran, Chandrasekharan - In: European journal of industrial engineering : EJIE 5 (2011) 4, pp. 361-387

Persistent link: https://www.econbiz.de/10009882603