Single-machine scheduling to minimize the number of early jobs

This study proposes a novel method to determine the minimum number of early jobs on a single machine, and demonstrates that this problem can be solved in polynomial time. The method's complexity is O(n log n). This study also provides computational performance of this method on problems with various sizes.