Single-machine scheduling to minimize the number of early jobs

  title={Single-machine scheduling to minimize the number of early jobs},
  author={R. H. Huang and C. L. Yang},
  journal={2007 IEEE International Conference on Industrial Engineering and Engineering Management},
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. 


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs.

  • E. Guner, S. Erol, K. Tani
  • International Journal of Production Economics,
  • 1998
1 Excerpt

Singlemachine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties.

  • W. X. Zheng, H. Nagasawa, N. Nishiyama
  • International Journal of Production Research,
  • 1993
1 Excerpt

Minimizing the number of late jobs with release time constraints.

  • J. Du, J.Y.T. Leung, C. S. Wong
  • Journal of Combinatorial Mathematics and…
  • 1992
1 Excerpt

An n jobs, one machine sequencing algorithm for minimizing the number of late jobs.

  • J. M. Moore
  • Management Science,
  • 1968
2 Excerpts

Similar Papers

Loading similar papers…