Analysis and Improvement of Scheduling Algorithms Based on (m, k)-Firm Constraint

Lanying Li, Yu Tan. Analysis and Improvement of Scheduling Algorithms Based on (m, k)-Firm Constraint. In 2008 International Symposium on Computer Science and Computational Technology, ISCSCT 2008, 20-22 December 2008, Shanghai, China, 2 Volumes. pages 74-77, IEEE Computer Society, 2008. [doi]

@inproceedings{LiT08-1,
  title = {Analysis and Improvement of Scheduling Algorithms Based on (m, k)-Firm Constraint},
  author = {Lanying Li and Yu Tan},
  year = {2008},
  doi = {10.1109/ISCSCT.2008.178},
  url = {http://doi.ieeecomputersociety.org/10.1109/ISCSCT.2008.178},
  tags = {rule-based, analysis, constraints},
  researchr = {https://researchr.org/publication/LiT08-1},
  cites = {0},
  citedby = {0},
  pages = {74-77},
  booktitle = {2008 International Symposium on Computer Science and Computational Technology, ISCSCT 2008, 20-22 December 2008, Shanghai, China, 2 Volumes},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3498-5},
}