• DocumentCode
    2610352
  • Title

    Single-machine scheduling to minimize the number of early jobs

  • Author

    Huang, R.H. ; Yang, C.L.

  • Author_Institution
    Fu Jen Catholic Univ., Taipei
  • fYear
    2007
  • fDate
    2-4 Dec. 2007
  • Firstpage
    955
  • Lastpage
    957
  • Abstract
    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.
  • Keywords
    computational complexity; job shop scheduling; single machine scheduling; computational complexity; early jobs; polynomial time; single-machine scheduling; Computational complexity; Costs; Job production systems; Job shop scheduling; Manufacturing; Optimal scheduling; Polynomials; Processor scheduling; Scheduling algorithm; Single machine scheduling; Scheduling; complexity; computational; polynomial;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Engineering and Engineering Management, 2007 IEEE International Conference on
  • Conference_Location
    Singapore
  • Print_ISBN
    978-1-4244-1529-8
  • Electronic_ISBN
    978-1-4244-1529-8
  • Type

    conf

  • DOI
    10.1109/IEEM.2007.4419333
  • Filename
    4419333
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2610352