Author:
Framinan Jose M.,Leisten Rainer,Ruiz García Rubén
Reference71 articles.
1. Adiri, I. and Pohoryles, D. (1982). Flowshop no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics, 29(3):495–504.
2. Agnetis, A., Alfieri, A., and Nicosia, G. (2009). Single-machine scheduling problems with generalized preemption. INFORMS Journal on Computing, 21(1):1–12.
3. Allahverdi, A., Gupta, J. N. D., and Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. OMEGA, The International Journal of Management Science, 27(2):219–239.
4. Allahverdi, A., Ng, C. T., Cheng, T. C. E., and Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3):985–1032.
5. Averbakh, I., Berman, O., and Chernykh, I. (2005). The $$m$$ m -machine flowshop problem with unit-time operations and intree precedence constraints. Operations Research Letters, 33(3):263–266.