单机调度 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "单机调度" in Chinese language version.
refsWebsite
Global rank
Chinese rank
5th place
12th place
1st place
1st place
149th place
292nd place
9th place
2nd place
doi.org (Global: 2nd place; Chinese: 23rd place)
- Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys. Chapter 9 Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science. 1993-01-01, 4: 445–522 [2022-02-23]. ISSN 0927-0507. doi:10.1016/S0927-0507(05)80189-6. （原始内容存档于2022-02-23） （英语）.
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property. Mathematical and Computer Modelling. 1994-07-01, 20 (2): 91–106 [2022-03-03]. ISSN 0895-7177. doi:10.1016/0895-7177(94)90209-7
. （原始内容存档于2022-03-11） （英语）. - Sahni, Sartaj K. Algorithms for Scheduling Independent Tasks. Journal of the ACM. 1976-01-01, 23 (1): 116–127. ISSN 0004-5411. doi:10.1145/321921.321934.
sciencedirect.com (Global: 149th place; Chinese: 292nd place)
- Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys. Chapter 9 Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science. 1993-01-01, 4: 445–522 [2022-02-23]. ISSN 0927-0507. doi:10.1016/S0927-0507(05)80189-6. （原始内容存档于2022-02-23） （英语）.
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property. Mathematical and Computer Modelling. 1994-07-01, 20 (2): 91–106 [2022-03-03]. ISSN 0895-7177. doi:10.1016/0895-7177(94)90209-7 . （原始内容存档于2022-03-11） （英语）.
web.archive.org (Global: 1st place; Chinese: 1st place)
- Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys. Chapter 9 Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science. 1993-01-01, 4: 445–522 [2022-02-23]. ISSN 0927-0507. doi:10.1016/S0927-0507(05)80189-6. （原始内容存档于2022-02-23） （英语）.
- Grinshpoun, Tal. Subjects in Scheduling. www.youtube.com. 2020 [2021-09-12]. （原始内容存档于2022-03-03）.
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property. Mathematical and Computer Modelling. 1994-07-01, 20 (2): 91–106 [2022-03-03]. ISSN 0895-7177. doi:10.1016/0895-7177(94)90209-7 . （原始内容存档于2022-03-11） （英语）.
worldcat.org (Global: 5th place; Chinese: 12th place)
- Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys. Chapter 9 Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science. 1993-01-01, 4: 445–522 [2022-02-23]. ISSN 0927-0507. doi:10.1016/S0927-0507(05)80189-6. （原始内容存档于2022-02-23） （英语）.
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property. Mathematical and Computer Modelling. 1994-07-01, 20 (2): 91–106 [2022-03-03]. ISSN 0895-7177. doi:10.1016/0895-7177(94)90209-7 . （原始内容存档于2022-03-11） （英语）.
- Sahni, Sartaj K. Algorithms for Scheduling Independent Tasks. Journal of the ACM. 1976-01-01, 23 (1): 116–127. ISSN 0004-5411. doi:10.1145/321921.321934.
youtube.com (Global: 9th place; Chinese: 2nd place)
- Grinshpoun, Tal. Subjects in Scheduling. www.youtube.com. 2020 [2021-09-12]. （原始内容存档于2022-03-03）.