• Title of article

    The complexity of scheduling job families about a common due date

  • Author/Authors

    S. T. Webster، نويسنده ,

  • Issue Information
    دوماهنامه با شماره پیاپی سال 1997
  • Pages
    10
  • From page
    65
  • To page
    74
  • Keywords
    Job families , Nonregularperformance measure , analysis of algorithms , computational complexity , multiple machine , Production/scheduling
  • Journal title
    Operations Research Letters
  • Serial Year
    1997
  • Journal title
    Operations Research Letters
  • Record number

    137046

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