Author:
Pérez-Rodríguez Ricardo,Hernández-Aguirre Arturo
Publisher
Springer Science and Business Media LLC
Reference57 articles.
1. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391–401
2. Ali A, Meilă M (2012) Experiments with Kemeny ranking: what works when?. Math Soc Sci 64(1):28–40
3. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149–156
4. Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-09
5. Bartholdi J, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welf 6(2):157–165
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献