Branch-and-Bound Algorithms for Scheduling in Permutation...

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, C. Rajendran and Y. Deepa
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
60
Language:
english
Journal:
The Journal of the Operational Research Society
DOI:
10.2307/40206818
Date:
July, 2009
File:
PDF, 2.40 MB
english, 2009
Conversion to is in progress
Conversion to is failed