Author:
Romanova A. A.,Servakh V. V.
Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference14 articles.
1. E. A. Bobrova, A. A. Romanova, V. V. Servakh, “The Complexity of the Cyclic Job Shop Problem with Identical Jobs,” Diskretn. Anal. Issled. Oper. 20 (4), 3–14 (2013).
2. A. A. Romanova and V. V. Servakh, “Optimization of Identical Jobs Production on the Base of Cyclic Schedules,” Diskretn. Anal. Issled. Oper. 15 (4), 47–60 (2008).
3. N. G. Hall, T. E. Lee, and M. E. Posner, “The Complexity of Cyclic Shop Scheduling Problems,” J. Scheduling 5 (4), 307–327 (2002).
4. C. Hanen, “Study of a NP-Hard Cyclic Scheduling Problem: the Recurrent Job-Shop,” European J. Oper. Res. 71, 82–101 (1994).
5. S. T. McCormick and U. S. Rao, “Some Complexity Results in Cyclic Scheduling,” Math. Comput. Modelling 20, 107–122 (1994).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献