Author:
Kyngäs Nico,Goossens Dries,Nurmi Kimmo,Kyngäs Jari
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
2. Tien, J., Kamiyama, A.: On Manpower Scheduling Algorithms. SIAM Rev. 24(3), 275–287 (1982)
3. Lau, H.C.: On the Complexity of Manpower Shift Scheduling. Computers and Operations Research 23(1), 93–102 (1996)
4. Marx, D.: Graph coloring problems and their applications in scheduling. Periodica Polytechnica Ser. El. Eng. 48, 5–10 (2004)
5. Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., Slany, W.: The minimum shift design problem. Annals of Operations Research 155(1), 79–105 (2007)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献