Author:
Liang Xi-Xi,Zhang Bo,Wang Ji-Bo,Yin Na,Huang Xue
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference42 articles.
1. Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26, 36–52 (1978)
2. Smutnicki, C.: Some results of worst-case analysis for flow shop scheduling. Eur. J. Oper. Res. 109, 66–87 (1998)
3. Hoogeveen, J.A., Kawaguchi, T.: Minimizing total completion time in a two-machine flowshop: analysis of special cases. Math. Oper. Res. 24, 887–910 (1999)
4. Koulamas, C., Kyparisis, G.J.: Algorithms with performance guarantees for flow shops with regular objective functions. IIE Trans. 37, 1107–1111 (2005)
5. Easwaran, G., Parten, L.E., Moras, R., Uhlig, P.X.: Makespan minimization in machine dominated flowshop scheduling. Appl. Math. Comput. 217, 110–116 (2010)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献