Algorithms for scheduling incompatible job families on single batching machine with limited capacity.

Computers & Industrial Engineering(2014)

引用 21|浏览8
暂无评分
摘要
•We introduce the problem of scheduling job families on single batching machine.•We present a mixed integer program and their computational complexity.•Polynomial time algorithms are proposed for the problem.•Time complexity and worst case performance of the algorithms are analyzed.
更多
查看译文
关键词
Scheduling,Single batching machine,Incompatible job families,Arbitrary job sizes,Approximation algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要