Author:
Glass Celia A.,Potts Chris N.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference40 articles.
1. E.H.L. Aarts, P.J.M. van Laarhoven, J.K. Lenstra and N.L.J. Ulder, A computational study of local search algorithms for job shop scheduling, ORSA J. Comp. 6(1994)118–125.
2. E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization: The assembly line balancing problem, ORSA J. Comp. 6(1994)161–173.
3. J.E. Baker, Reducing bias an inefficiency in the selection algorithm, in:Proc. 2nd Int. Conf. on Genetic Algorithms, ed. J.J. Grefenstette (Lawrence Erlbaum Associates, Hillside, NJ, 1987) pp. 14–21.
4. F. Della Croce, R. Tadei and G. Volta, A genetic algorithm for the job shop problem, Comp. Oper. Res. 22(1995)15–24.
5. M. Dell'Amico and M. Trubian, Applying tabu-search to the job-shop scheduling problem, Ann. Oper. Res. 41(1992)231–252.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献