Author:
Bargaoui Hafewa,Driss Olfa Belkahla
Publisher
Springer International Publishing
Reference17 articles.
1. Graham, R.L., Lawler, E., Lenstra, J.K., Rinnooy Kan, A.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics 5, 236–287 (1979)
2. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)
3. Johnson, S.M.: Optimal two- and three-stage productionschedules with setup times included. Naval Research Logistics Quarterly 1, 61–68 (1954)
4. Ladhari, T., Haouari, M.: A computational study of the permutationflow shop problem based on a tight lower bound. Computers & Operations Research 32, 1831–1847 (2005)
5. Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristicalgorithm for the n job, m machine sequencing problem. Management Science 16(10), B630–B637 (1970)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献