首页 /研究 /Identical coupled task scheduling: polynomial complexity of the cyclic case
OTHER

Identical coupled task scheduling: polynomial complexity of the cyclic case

Vassilissa Lehoux‐Lebacque, Nadia Brauner, Gerd Finke

发表年份
2015
引用次数
17

关键词

Computer scienceScheduling (production processes)Computational complexity theoryTime complexityJob shop schedulingDistributed computingMathematical optimizationTheoretical computer scienceAlgorithmMathematics

相关论文

查看 OTHER 分类全部论文