Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Socorro Rangel
2010 – today
- 2012
[c1]Socorro Rangel, Michelli Maldonado: Strategies to Model Scheduling Decisions to Plan the Soft Drink Production Process. ICORES 2012: 181-185- 2010
- [j6]Igor S. Litvinchev, Miguel Mata Pérez, Socorro Rangel, Jania Saucedo: Lagrangian heuristic for a class of the generalized assignment problems. Computers & Mathematics with Applications 60(4): 1115-1123 (2010)
- [j5]Deisemara Ferreira, Reinaldo Morabito, Socorro Rangel: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Computers & OR 37(4): 684-691 (2010)
- [j4]Igor S. Litvinchev, Socorro Rangel, Jania Saucedo: A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. 19(3): 241-257 (2010)
2000 – 2009
- 2009
- [j3]Deisemara Ferreira, Reinaldo Morabito, Socorro Rangel: Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research 196(2): 697-706 (2009)
- 2008
- [p1]Deisemara Ferreira, Paulo Morelato França, Alf Kimms, Reinaldo Morabito, Socorro Rangel, Claudio Fabiano Motta Toledo: Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study. Metaheuristics for Scheduling in Industrial and Manufacturing Applications 2008: 169-210
- 2006
- [j2]Igor S. Litvinchev, Socorro Rangel: Using error bounds to compare aggregated generalized transportation models. Annals OR 146(1): 119-134 (2006)
1990 – 1999
- 1999
- [j1]Igor S. Litvinchev, Socorro Rangel: Localization of the optimal solution and a posteriori bounds for aggregation. Computers & OR 26(10-11): 967-988 (1999)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-12 20:30 CEST by the dblp team