• DocumentCode
    1671117
  • Title

    A special Parallel Job Shop Scheduling problem

  • Author

    Fan, Kun

  • Author_Institution
    School of Economics and Management Beijing Forestry University, BJFU Beijing, China
  • fYear
    2011
  • Firstpage
    1
  • Lastpage
    3
  • Abstract
    A special Parallel Job Shop Scheduling problem was defined and contrasted with FJc(Flexible job shop) scheduling problem. The PARTITION transformation was used to prove that J3prllCmax is a NP-hard problem, and this deduce the compute complexity of Parallel Job Shop Scheduling, i.e. JmprllCmax (m≥3) is also a NP-hard problem. Moreover, the Parallel Job Shop Scheduling problem was deeply illustrated by a real production example.
  • Keywords
    Job shop scheduling; Manganese; NP-hard problem; Parallel machines; Processor scheduling; Job Shop; Scheduling; parallel;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    E -Business and E -Government (ICEE), 2011 International Conference on
  • Conference_Location
    Shanghai, China
  • Print_ISBN
    978-1-4244-8691-5
  • Type

    conf

  • DOI
    10.1109/ICEBEG.2011.5886774
  • Filename
    5886774
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1671117