An Exact Borderline Between the NP-hard and Polynomial-Time Solvable Cases of Flow Shop Scheduling with Job-Dependent Storage Requirements
JOURNAL OF COMBINATORIAL OPTIMIZATION（2024）
关键词
Flow shop,Job-dependent storage requirement,Computational complexity,Polynomial time algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要