A branch and bound algorithm for the cyclic job-shop problem with transportation

From MaRDI portal
Publication:339670

DOI10.1016/J.COR.2012.04.008zbMATH Open1349.90321OpenAlexW2005389774MaRDI QIDQ339670FDOQ339670


Authors: Peter Brucker, Sven Groenemeyer, Edmund K. Burke Edit this on Wikidata


Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.008




Recommendations




Cites Work


Cited In (6)





This page was built for publication: A branch and bound algorithm for the cyclic job-shop problem with transportation

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