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 j

From MaRDI portal
Publication:3394089

DOI10.1057/PALGRAVE.JORS.2602642zbMATH Open1168.90649OpenAlexW2088511615MaRDI QIDQ3394089FDOQ3394089


Authors: N. Madhushini, Chandrasekharan Rajendran, Y. Deepa Edit this on Wikidata


Publication date: 28 August 2009

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602642




Recommendations





Cited In (6)





This page was built for publication: 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 j

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394089)