z-logo
open-access-imgOpen Access
Strong NP-completeness of Single Machine Scheduling with Resource Dependent Release Times and Processing Times
Author(s) -
Ik Sun Lee
Publication year - 2014
Publication title -
gyeongyeong gwahag - hangug gyeongyeong gwahaghoe/gyeong'yeong gwahag - han'gug gyeong'yeong gwahaghoe
Language(s) - English
Resource type - Journals
eISSN - 2765-5687
pISSN - 1225-1100
DOI - 10.7737/kmsr.2014.31.2.065
Subject(s) - single machine scheduling , job shop scheduling , scheduling (production processes) , computer science , resource consumption , mathematical optimization , fair share scheduling , dynamic priority scheduling , mathematics , computer network , ecology , quality of service , biology , routing (electronic design automation)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here