Author:
Munoz L.,Villalobos J.R.,Fowler J.W.
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference39 articles.
1. Abeledo, H., Fukasawa, R., Pessoa, A., & Uchoa, E. (2010). The time dependent traveling salesman problem: Polyhedra and branch-cut-and-price algorithm. Ln: Festa P (Ed) Experimental Algorithms, Lecture Notes in Computer Science, Vol 6049, Springer Berlin Heidelberg, Pp202-213.
2. Cycle-time improvements for photolithography process in semiconductor manufacturing;Akcalt;IEEE Trans. Semicond. Manuf.,2001
3. A survey of scheduing research involving setup considerations;Allahverdi;OMEGA – Int. J. Manage. Sci.,1999
4. The third comprehensive survey on scheduling problems with setup times/costs;Allahverdi;Eur. J. Oper. Res.,2015
5. A survey of scheduling problems with setup times or costs;Allahverdi;Eur. J. Oper. Res.,2008
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献