Makespan Minimization for Two-Machine Open Shops

International Series in Operations Research & Management Science（2021）

引用 0|浏览0

暂无评分

摘要

The two-machine open shopTwo-machine open shop makespan Makespan minimization problem, $$O2||C_{\max }$$ , is one of the most gracious scheduling problems.

查看译文

关键词

two-machine

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要