Author:
Filippi Carlo,Romanin-Jacur Giorgio
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference22 articles.
1. Andreatta, G., Filippi, C., & Romanin-Jacur, G. (1993). The linear balancing flow problem. European Journal of Operational Research, 64(1), 68–82.
2. Armstrong, R., Jin, Z., & Xu, Y. (1997). A polynomial algorithm for a linear balancing flow problem (Rutcor Research Report 24-97). Rutgers University.
3. Bertsimas, D., & Sethuraman, J. (2002). From fluid relaxation to practical algorithms for job shop scheduling: the makespan objective. Mathematical Programming, 92, 61–102.
4. Brauner, N., Crama, Y., Grigoriev, A., & van De Klundert, J. (2005). A framework for the complexity of high-multiplicity scheduling problems. Journal of Combinatorial Optimization, 9, 313–323.
5. Brauner, N., Crama, Y., Grigoriev, A., & van De Klundert, J. (2007). Multiplicity and complexity issues in contemporary production scheduling. Statistica Neerlandica, 61, 75–91.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献