• Title of article

    Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

  • Author/Authors

    Guohua Wan، نويسنده , , Benjamin P. -C. Yen، نويسنده , , Chung-Lun Li، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2001
  • Pages
    8
  • From page
    273
  • To page
    280
  • Keywords
    Scheduling , computational complexity
  • Journal title
    Information Processing Letters
  • Serial Year
    2001
  • Journal title
    Information Processing Letters
  • Record number

    129385

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129385