Single-machine scheduling (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Single-machine scheduling" in English language version.

refsWebsite

Global rank English rank

19doi.org

2^nd place

16worldcat.org

5^th place

6sciencedirect.com

149^th place

178^th place

6semanticscholar.org

11^th place

8^th place

2wiley.com

222^nd place

297^th place

2arxiv.org

69^th place

59^th place

1youtube.com

9^th place

13^th place

1siam.org

low place

6,473^rd place

arxiv.org (Global: 69^th place; English: 59^th place)

Chrobak, Marek; Dürr, Christoph; Jawor, Wojciech; Kowalik, Łukasz; Kurowski, Maciej (2006-02-01). "A Note on Scheduling Equal-Length Jobs to Maximize Throughput". Journal of Scheduling. 9 (1): 71–73. arXiv:cs/0410046. doi:10.1007/s10951-006-5595-4. ISSN 1099-1425. S2CID 7359990.
Chrobak, Marek; Durr, Christoph; Jawor, Wojciech; Kowalik, Lukasz; Kurowski, Maciej (2021-05-12). "A Note on Scheduling Equal-Length Jobs to Maximize Throughput". arXiv:cs/0410046.

doi.org (Global: 2^nd place; English: 2^nd place)

doi.org

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys (1993-01-01). "Chapter 9 Sequencing and scheduling: Algorithms and complexity". Handbooks in Operations Research and Management Science. 4: 445–522. doi:10.1016/S0927-0507(05)80189-6. ISBN 9780444874726. ISSN 0927-0507.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Sahni, Sartaj K. (1976-01-01). "Algorithms for Scheduling Independent Tasks". Journal of the ACM. 23 (1): 116–127. doi:10.1145/321921.321934. ISSN 0004-5411. S2CID 10956951.
Lawler, E.L. (1994-07-01). "Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property". Mathematical and Computer Modelling. 20 (2): 91–106. doi:10.1016/0895-7177(94)90209-7. ISSN 0895-7177.
Baptiste, P. (1999). "Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times". Journal of Scheduling. 2 (6): 245–252. doi:10.1002/(SICI)1099-1425(199911/12)2:6<245::AID-JOS28>3.0.CO;2-5.
Chrobak, Marek; Dürr, Christoph; Jawor, Wojciech; Kowalik, Łukasz; Kurowski, Maciej (2006-02-01). "A Note on Scheduling Equal-Length Jobs to Maximize Throughput". Journal of Scheduling. 9 (1): 71–73. arXiv:cs/0410046. doi:10.1007/s10951-006-5595-4. ISSN 1099-1425. S2CID 7359990.
Simons, Barbara (1978-10-16). "A fast algorithm for single processor scheduling". 19th Annual Symposium on Foundations of Computer Science (SFCS 1978). IEEE Computer Society. pp. 246–252. doi:10.1109/SFCS.1978.4. S2CID 10284575.
Garey, M. R.; Johnson, D. S.; Simons, B. B.; Tarjan, R. E. (1981-05-01). "Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines". SIAM Journal on Computing. 10 (2): 256–269. doi:10.1137/0210018. ISSN 0097-5397.
Bar-Noy, Amotz; Bar-Yehuda, Reuven; Freund, Ari; (Seffi) Naor, Joseph; Schieber, Baruch (2001-09-01). "A unified approach to approximating resource allocation and scheduling". Journal of the ACM. 48 (5): 1069–1090. doi:10.1145/502102.502107. ISSN 0004-5411. S2CID 12329294.
Cheng, T. C. E; Ding, Q; Lin, B. M. T (2004-01-01). "A concise survey of scheduling with time-dependent processing times". European Journal of Operational Research. 152 (1): 1–13. doi:10.1016/S0377-2217(02)00909-8. ISSN 0377-2217.
Chang, Pei-Chann; Chen, Shih-Hsin; Mani, V. (2009-01-01). "A note on due-date assignment and single machine scheduling with a learning/aging effect". International Journal of Production Economics. 117 (1): 142–149. doi:10.1016/j.ijpe.2008.10.004. ISSN 0925-5273.
Cheng, T. C. E.; Ding, Q. (1999-07-01). "The time dependent machine makespan problem is strongly NP-complete". Computers & Operations Research. 26 (8): 749–754. doi:10.1016/S0305-0548(98)00093-8. ISSN 0305-0548.
Cheng, T. C. E.; Ding, Q. (1998-06-01). "The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times". Computers & Mathematics with Applications. 35 (12): 95–100. doi:10.1016/S0898-1221(98)00099-6. ISSN 0898-1221.
Cheng, T. C. E.; Ding, Q. (1998-01-29). "The complexity of scheduling starting time dependent tasks with release times". Information Processing Letters. 65 (2): 75–79. doi:10.1016/S0020-0190(97)00195-6. ISSN 0020-0190.
Kubiak, Wieslaw; van de Velde, Steef (August 1998). "Scheduling deteriorating jobs to minimize makespan". Naval Research Logistics. 45 (5): 511–523. doi:10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6. ISSN 0894-069X.
Gawiejnowicz, Stanisław (1996-03-25). "A note on scheduling on a single processor with speed dependent on a number of executed jobs". Information Processing Letters. 57 (6): 297–300. doi:10.1016/0020-0190(96)00021-X. ISSN 0020-0190.
Gordon, V. S.; Potts, C. N.; Strusevich, V. A.; Whitehead, J. D. (2008-10-01). "Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation". Journal of Scheduling. 11 (5): 357–370. doi:10.1007/s10951-008-0064-x. ISSN 1099-1425. S2CID 31422825.
Wang, Ji-Bo; Wang, Li-Yan; Wang, Dan; Wang, Xiao-Yuan (2009-08-01). "Single-machine scheduling with a time-dependent deterioration". The International Journal of Advanced Manufacturing Technology. 43 (7): 805–809. doi:10.1007/s00170-008-1760-6. ISSN 1433-3015. S2CID 110043439.
Rudek, Radosław (2012-03-01). "Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect". The International Journal of Advanced Manufacturing Technology. 59 (1): 299–309. doi:10.1007/s00170-011-3481-5. ISSN 1433-3015.

dx.doi.org

Gawiejnowicz, Stanisław (1996-03-25). "A note on scheduling on a single processor with speed dependent on a number of executed jobs". Information Processing Letters. 57 (6): 297–300. doi:10.1016/0020-0190(96)00021-X. ISSN 0020-0190.

sciencedirect.com (Global: 149^th place; English: 178^th place)

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys (1993-01-01). "Chapter 9 Sequencing and scheduling: Algorithms and complexity". Handbooks in Operations Research and Management Science. 4: 445–522. doi:10.1016/S0927-0507(05)80189-6. ISBN 9780444874726. ISSN 0927-0507.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Cheng, T. C. E; Ding, Q; Lin, B. M. T (2004-01-01). "A concise survey of scheduling with time-dependent processing times". European Journal of Operational Research. 152 (1): 1–13. doi:10.1016/S0377-2217(02)00909-8. ISSN 0377-2217.
Chang, Pei-Chann; Chen, Shih-Hsin; Mani, V. (2009-01-01). "A note on due-date assignment and single machine scheduling with a learning/aging effect". International Journal of Production Economics. 117 (1): 142–149. doi:10.1016/j.ijpe.2008.10.004. ISSN 0925-5273.
Cheng, T. C. E.; Ding, Q. (1999-07-01). "The time dependent machine makespan problem is strongly NP-complete". Computers & Operations Research. 26 (8): 749–754. doi:10.1016/S0305-0548(98)00093-8. ISSN 0305-0548.
Cheng, T. C. E.; Ding, Q. (1998-06-01). "The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times". Computers & Mathematics with Applications. 35 (12): 95–100. doi:10.1016/S0898-1221(98)00099-6. ISSN 0898-1221.
Cheng, T. C. E.; Ding, Q. (1998-01-29). "The complexity of scheduling starting time dependent tasks with release times". Information Processing Letters. 65 (2): 75–79. doi:10.1016/S0020-0190(97)00195-6. ISSN 0020-0190.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Sahni, Sartaj K. (1976-01-01). "Algorithms for Scheduling Independent Tasks". Journal of the ACM. 23 (1): 116–127. doi:10.1145/321921.321934. ISSN 0004-5411. S2CID 10956951.
Chrobak, Marek; Dürr, Christoph; Jawor, Wojciech; Kowalik, Łukasz; Kurowski, Maciej (2006-02-01). "A Note on Scheduling Equal-Length Jobs to Maximize Throughput". Journal of Scheduling. 9 (1): 71–73. arXiv:cs/0410046. doi:10.1007/s10951-006-5595-4. ISSN 1099-1425. S2CID 7359990.
Simons, Barbara (1978-10-16). "A fast algorithm for single processor scheduling". 19th Annual Symposium on Foundations of Computer Science (SFCS 1978). IEEE Computer Society. pp. 246–252. doi:10.1109/SFCS.1978.4. S2CID 10284575.
Bar-Noy, Amotz; Bar-Yehuda, Reuven; Freund, Ari; (Seffi) Naor, Joseph; Schieber, Baruch (2001-09-01). "A unified approach to approximating resource allocation and scheduling". Journal of the ACM. 48 (5): 1069–1090. doi:10.1145/502102.502107. ISSN 0004-5411. S2CID 12329294.
Gordon, V. S.; Potts, C. N.; Strusevich, V. A.; Whitehead, J. D. (2008-10-01). "Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation". Journal of Scheduling. 11 (5): 357–370. doi:10.1007/s10951-008-0064-x. ISSN 1099-1425. S2CID 31422825.
Wang, Ji-Bo; Wang, Li-Yan; Wang, Dan; Wang, Xiao-Yuan (2009-08-01). "Single-machine scheduling with a time-dependent deterioration". The International Journal of Advanced Manufacturing Technology. 43 (7): 805–809. doi:10.1007/s00170-008-1760-6. ISSN 1433-3015. S2CID 110043439.

siam.org (Global: low place; English: 6,473^rd place)

epubs.siam.org

Garey, M. R.; Johnson, D. S.; Simons, B. B.; Tarjan, R. E. (1981-05-01). "Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines". SIAM Journal on Computing. 10 (2): 256–269. doi:10.1137/0210018. ISSN 0097-5397.

wiley.com (Global: 222^nd place; English: 297^th place)

onlinelibrary.wiley.com

Baptiste, P. (1999). "Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times". Journal of Scheduling. 2 (6): 245–252. doi:10.1002/(SICI)1099-1425(199911/12)2:6<245::AID-JOS28>3.0.CO;2-5.
Kubiak, Wieslaw; van de Velde, Steef (August 1998). "Scheduling deteriorating jobs to minimize makespan". Naval Research Logistics. 45 (5): 511–523. doi:10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6. ISSN 0894-069X.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys (1993-01-01). "Chapter 9 Sequencing and scheduling: Algorithms and complexity". Handbooks in Operations Research and Management Science. 4: 445–522. doi:10.1016/S0927-0507(05)80189-6. ISBN 9780444874726. ISSN 0927-0507.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Sahni, Sartaj K. (1976-01-01). "Algorithms for Scheduling Independent Tasks". Journal of the ACM. 23 (1): 116–127. doi:10.1145/321921.321934. ISSN 0004-5411. S2CID 10956951.
Lawler, E.L. (1994-07-01). "Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property". Mathematical and Computer Modelling. 20 (2): 91–106. doi:10.1016/0895-7177(94)90209-7. ISSN 0895-7177.
Chrobak, Marek; Dürr, Christoph; Jawor, Wojciech; Kowalik, Łukasz; Kurowski, Maciej (2006-02-01). "A Note on Scheduling Equal-Length Jobs to Maximize Throughput". Journal of Scheduling. 9 (1): 71–73. arXiv:cs/0410046. doi:10.1007/s10951-006-5595-4. ISSN 1099-1425. S2CID 7359990.
Garey, M. R.; Johnson, D. S.; Simons, B. B.; Tarjan, R. E. (1981-05-01). "Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines". SIAM Journal on Computing. 10 (2): 256–269. doi:10.1137/0210018. ISSN 0097-5397.
Bar-Noy, Amotz; Bar-Yehuda, Reuven; Freund, Ari; (Seffi) Naor, Joseph; Schieber, Baruch (2001-09-01). "A unified approach to approximating resource allocation and scheduling". Journal of the ACM. 48 (5): 1069–1090. doi:10.1145/502102.502107. ISSN 0004-5411. S2CID 12329294.
Cheng, T. C. E; Ding, Q; Lin, B. M. T (2004-01-01). "A concise survey of scheduling with time-dependent processing times". European Journal of Operational Research. 152 (1): 1–13. doi:10.1016/S0377-2217(02)00909-8. ISSN 0377-2217.
Chang, Pei-Chann; Chen, Shih-Hsin; Mani, V. (2009-01-01). "A note on due-date assignment and single machine scheduling with a learning/aging effect". International Journal of Production Economics. 117 (1): 142–149. doi:10.1016/j.ijpe.2008.10.004. ISSN 0925-5273.
Cheng, T. C. E.; Ding, Q. (1999-07-01). "The time dependent machine makespan problem is strongly NP-complete". Computers & Operations Research. 26 (8): 749–754. doi:10.1016/S0305-0548(98)00093-8. ISSN 0305-0548.
Cheng, T. C. E.; Ding, Q. (1998-06-01). "The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times". Computers & Mathematics with Applications. 35 (12): 95–100. doi:10.1016/S0898-1221(98)00099-6. ISSN 0898-1221.
Cheng, T. C. E.; Ding, Q. (1998-01-29). "The complexity of scheduling starting time dependent tasks with release times". Information Processing Letters. 65 (2): 75–79. doi:10.1016/S0020-0190(97)00195-6. ISSN 0020-0190.
Kubiak, Wieslaw; van de Velde, Steef (August 1998). "Scheduling deteriorating jobs to minimize makespan". Naval Research Logistics. 45 (5): 511–523. doi:10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6. ISSN 0894-069X.
Gawiejnowicz, Stanisław (1996-03-25). "A note on scheduling on a single processor with speed dependent on a number of executed jobs". Information Processing Letters. 57 (6): 297–300. doi:10.1016/0020-0190(96)00021-X. ISSN 0020-0190.
Gordon, V. S.; Potts, C. N.; Strusevich, V. A.; Whitehead, J. D. (2008-10-01). "Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation". Journal of Scheduling. 11 (5): 357–370. doi:10.1007/s10951-008-0064-x. ISSN 1099-1425. S2CID 31422825.
Wang, Ji-Bo; Wang, Li-Yan; Wang, Dan; Wang, Xiao-Yuan (2009-08-01). "Single-machine scheduling with a time-dependent deterioration". The International Journal of Advanced Manufacturing Technology. 43 (7): 805–809. doi:10.1007/s00170-008-1760-6. ISSN 1433-3015. S2CID 110043439.
Rudek, Radosław (2012-03-01). "Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect". The International Journal of Advanced Manufacturing Technology. 59 (1): 299–309. doi:10.1007/s00170-011-3481-5. ISSN 1433-3015.

youtube.com (Global: 9^th place; English: 13^th place)

Grinshpoun, Tal (2020). "Subjects in Scheduling". www.youtube.com. Retrieved 2021-09-12.

Single-machine scheduling (English Wikipedia)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)