Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

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

Release와 Processing time이 투입자원에 종속적인 단일설비 일정계획문제의 Strong NP-completeness 분석

  • 이익선 (동아대학교 경영대학 경영학과)
  • Received : 2014.03.25
  • Accepted : 2014.05.08
  • Published : 2014.07.31
Download PDF
⟨ Previous Next ⟩

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

References

  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. https://doi.org/10.1016/S0167-5060(08)70356-X
  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. https://doi.org/10.1016/0377-2217(91)90065-4
  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. https://doi.org/10.1016/j.ejor.2003.10.024