참고문헌
- Garey, M.R. and D.S. Johnson, Computers and Intractability : A Guide to the Theory of NPCompleteness, Freeman, New York, 1979.
- 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
- 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
- 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