首页 /研究 /A branch and bound algorithm for the cyclic job-shop problem with transportation
OTHER

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

Peter Brucker, Edmund Burke, Sven Groenemeyer

发表年份
2012
引用次数
29

关键词

Bounding overwatchBranch and boundTransportation theorySolverMathematical optimizationJob shopComputer scienceConstruct (python library)Branch and cutSearch tree

相关论文

查看 OTHER 分类全部论文