A New Branch-and-Bound Algorithm for the Unrelated Parallel Machine Scheduling Problem with Sequence-Dependent Setup Times

M. Aramon Bajestani, R. Tavakkoli-Moghaddam

IFAC Proceedings Volumes(2009)

引用 0|浏览0
暂无评分
关键词
Parallel machines scheduling,sequence-dependent setup times,Total weighted tardiness,Branch-and-bound algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要