default search action
Socorro Rangel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j13]Eduardo dos Santos Teixeira, Socorro Rangel, Helenice de Oliveira Florentino, Silvio Alexandre de Araujo:
A review of mathematical optimization models applied to the sugarcane supply chain. Int. Trans. Oper. Res. 30(4): 1755-1788 (2023) - 2021
- [j12]Willy Alves de Oliveira Soler, Maristela Oliveira Santos, Socorro Rangel:
Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources. RAIRO Oper. Res. 55(3): 1949-1970 (2021) - 2018
- [j11]Helio Yochihiro Fuchigami, Ruhul A. Sarker, Socorro Rangel:
Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling. Algorithms 11(4): 43 (2018) - [j10]Helio Yochihiro Fuchigami, Socorro Rangel:
A survey of case studies in production scheduling: Analysis and perspectives. J. Comput. Sci. 25: 425-436 (2018) - 2017
- [j9]Alyne Toscano, Socorro Rangel, Horacio Hideki Yanasse:
A heuristic approach to minimize the number of saw cycles in small-scale furniture factories. Ann. Oper. Res. 258(2): 719-746 (2017) - [j8]Matheus Vanzela, Gislaine Mara Melega, Socorro Rangel, Silvio Alexandre de Araujo:
The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production. Comput. Oper. Res. 79: 148-160 (2017) - 2010
- [j7]Igor S. Litvinchev, Miguel Mata Pérez, Socorro Rangel, Jania Saucedo:
Lagrangian heuristic for a class of the generalized assignment problems. Comput. Math. Appl. 60(4): 1115-1123 (2010) - [j6]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. Comput. Oper. Res. 37(4): 684-691 (2010) - [j5]Igor S. Litvinchev, Socorro Rangel, Jania Saucedo:
A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. 19(3): 241-257 (2010) - 2009
- [j4]Deisemara Ferreira, Reinaldo Morabito, Socorro Rangel:
Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur. J. Oper. Res. 196(2): 697-706 (2009) - 2006
- [j3]Igor S. Litvinchev, Socorro Rangel:
Using error bounds to compare aggregated generalized transportation models. Ann. Oper. Res. 146(1): 119-134 (2006) - 1999
- [j2]Igor S. Litvinchev, Socorro Rangel:
Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. 26(10-11): 967-988 (1999) - 1998
- [j1]Ken Darby-Dowman, Socorro Rangel:
The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems. Comput. Optim. Appl. 11(3): 297-318 (1998)
Conference and Workshop Papers
- 2012
- [c1]Socorro Rangel, Michelli Maldonado:
Strategies to Model Scheduling Decisions to Plan the Soft Drink Production Process. ICORES 2012: 181-185
Parts in Books or Collections
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint