Browse > Article
http://dx.doi.org/10.7737/KMSR.2014.31.2.065

Strong NP-completeness of Single Machine Scheduling with Resource Dependent Release Times and Processing Times  

Lee, Ik Sun (School of Business, Dong-A University)
Publication Information
Korean Management Science Review / v.31, no.2, 2014 , pp. 65-70 More about this Journal
Abstract
This paper considers a single machine scheduling problem to determine release and processing times where both the release times and processing times are linearly decreasing functions of resources. The objective is to minimize the sum of the associated resource consumption cost and scheduling cost including makespan, sum of completion times, maximum lateness, or sum of lateness. This paper proves that the scheduling problem is NP-hard in the strong sense even if the release times are constant.
Keywords
Scheduling; Resource Dependent Release Times; Resource Dependent Processing Times;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Garey, M.R. and D.S. Johnson, Computers and Intractability : A Guide to the Theory of NPCompleteness, Freeman, New York, 1979.
2 Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, "Optimization and approximation in deterministic machine scheduling : A survey," Annals of Discrete Mathematics, Vol.5(1979), pp.287-326.   DOI
3 Janiak, A., "Single machine scheduling problem with a common deadline and resource dependent release dates," European Journal of Operational Research, Vol.53(1991), pp.317-325.   DOI
4 Wang, X. and T.C.E. Cheng, "Single machine scheduling with resource dependent release times and processing times," European Journal of Operational Research, Vol.162(2005), pp.727-739.   DOI