论文信息 - Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints - 字舞流文

Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints

Guangting Chen | Yong Chen | An Zhang | Xing Wang | Liang Zhang

[1] Mourad Boudhar,et al. Scheduling jobs on identical machines with agreement graph , 2012, Comput. Oper. Res..

[2] Dana Ron,et al. Scheduling with conflicts: online and offline algorithms , 2009, J. Sched..

[3] Ronald L. Graham,et al. Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[4] Bertrand M. T. Lin,et al. Parallel dedicated machine scheduling with conflict graphs , 2018, Comput. Ind. Eng..

[5] Ammar Oulamara,et al. Scheduling: Agreement graph vs resource constraints , 2015, Eur. J. Oper. Res..

[6] Martin Fürer,et al. Packing-Based Approximation Algorithm for the k-Set Cover Problem , 2011, ISAAC.

[7] Klaus Jansen,et al. Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..

[8] Mourad Boudhar,et al. New results in two identical machines scheduling with agreement graphs , 2019, Theor. Comput. Sci..