Narrow search
Showing 1 - 5 of 5
Cover Image
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 tardine...
Madhushini, N.; Rajendran, C.; Deepa, Y. - In: Journal of the Operational Research Society : OR 60 (2009) 7, pp. 991-1004
Persistent link: https://www.econbiz.de/10003869847
Cover Image
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 tardine...
Madhushini, N.; Rajendran, C.; Deepa, Y. - In: Journal of the Operational Research Society : OR 60 (2009) 7, pp. 991-1004
Persistent link: https://www.econbiz.de/10008261985
Cover Image
Efficient dispatching rules for scheduling in a job shop
Holthaus, O.; Rajendran, C. - In: International journal of production economics 48 (1997) 1, pp. 87-106
Persistent link: https://www.econbiz.de/10006318094
Cover Image
Research Papers - Efficient jobshop dispatching rules: Further developments
Holthaus, O.; Rajendran, C. - In: Production planning & control : PPC 11 (2000) 2, pp. 171-178
Persistent link: https://www.econbiz.de/10007181546
Cover Image
A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
Holthaus, O.; Rajendran, C. - In: Journal of the Operational Research Society : OR 56 (2005) 8, pp. 947-953
Persistent link: https://www.econbiz.de/10006015796