A Better Algorithm for an Ancient Scheduling Problem

Article Properties
Citations
Title Journal Journal Categories Citations Publication Date
Machine Covering in the Random-Order Model Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
1 2022
Nash Social Welfare in Selfish and Online Load Balancing

ACM Transactions on Economics and Computation
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
1 2022
Online List Scheduling for Makespan Minimization

ACM SIGACT News 1 2022
Scheduling in the Random-Order Model

Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
2021
Online Makespan Scheduling with Job Migration on Uniform Machines

Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
1 2021
Citations Analysis
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 30 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Semi on-line algorithms for the partition problem and was published in 1997. The most recent citation comes from a 2022 study titled Nash Social Welfare in Selfish and Online Load Balancing. This article reached its peak citation in 2000, with 6 citations. It has been cited in 32 different journals. Among related journals, the Theoretical Computer Science cited this research the most, with 8 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year