• DocumentCode
    381244
  • Title

    Solving nonstandard job-shop scheduling problem by loading balance of machines scheduling algorithm

  • Author

    Fengru, Wang ; Zhiqiang, Wang ; Shuwen, Yang ; Dongxue, Chen

  • Author_Institution
    Bus. Coll., Harbin Commercial Univ., China
  • Volume
    3
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    2338
  • Abstract
    For the nonstandard job-shop scheduling problem (NJSSP) in which some operations are processed on several identical machines, we built the objective function of machine load balancing of a nonstandard scheduling algorithm. Through complexity analysis of operation processes, the algorithm has lower complexity. Experiments indicated that the scheduling result of the algorithm compares with other methods.
  • Keywords
    computational complexity; production control; resource allocation; scheduling; complexity analysis; condition constraints; experiments; load balancing; machine scheduling algorithm; nonstandard job-shop scheduling; objective function; Algorithm design and analysis; Automation; Business; Educational institutions; Intelligent control; Load management; Scheduling algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on
  • Print_ISBN
    0-7803-7268-9
  • Type

    conf

  • DOI
    10.1109/WCICA.2002.1021508
  • Filename
    1021508
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=381244