Skip to main content
Article thumbnail
Location of Repository

A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times

By Radosław RadosławRudek
Publisher: World Scientific
Year: 2011
DOI identifier: 10.1007/s11590-011-0330-2
OAI identifier:
Provided by: Springer
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.