default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaime Cerdá
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j23]Nélida B. Camussi, Jaime Cerdá, Diego C. Cafaro
:
"Mathematical formulations for the optimal sequencing and lot sizing in multiproduct synchronous assembly lines". Comput. Ind. Eng. 152: 107006 (2021)- 2019
- [j22]Vanina G. Cafaro, Pedro C. Pautasso, Jaime Cerdá, Diego C. Cafaro:
Efficient planning of crude oil supplies through long-distance pipelines. Comput. Chem. Eng. 122: 203-217 (2019) - 2015
- [j21]Vanina G. Cafaro, Diego C. Cafaro, Carlos A. Méndez, Jaime Cerdá:
Optimization model for the detailed scheduling of multi-source pipelines. Comput. Ind. Eng. 88: 395-409 (2015) - [j20]Vanina G. Cafaro, Diego C. Cafaro, Carlos A. Méndez, Jaime Cerdá:
MINLP model for the detailed scheduling of refined products pipelines with flow rate dependent pumping costs. Comput. Chem. Eng. 72: 210-221 (2015) - [j19]Rodolfo G. Dondo, Jaime Cerdá:
The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system. Comput. Chem. Eng. 76: 42-62 (2015) - 2014
- [j18]Diego C. Cafaro, Jaime Cerdá:
Rigorous formulation for the scheduling of reversible-flow multiproduct pipelines. Comput. Chem. Eng. 61: 59-76 (2014) - [j17]Rodolfo G. Dondo, Jaime Cerdá:
A monolithic approach to vehicle routing and operations scheduling of a cross-dock system with multiple dock doors. Comput. Chem. Eng. 63: 184-205 (2014) - 2013
- [j16]Rodolfo G. Dondo, Jaime Cerdá:
A sweep-heuristic based formulation for the vehicle routing problem with cross-docking. Comput. Chem. Eng. 48: 293-311 (2013) - 2012
- [j15]Diego C. Cafaro, Jaime Cerdá:
Rigorous scheduling of mesh-structure refined petroleum pipeline networks. Comput. Chem. Eng. 38: 185-203 (2012) - [j14]M. Fernanda Gleizes, Germán Herrero, Diego C. Cafaro, Carlos A. Méndez, Jaime Cerdá:
Managing Distribution in Refined Products Pipelines Using Discrete-Event Simulation. Int. J. Inf. Syst. Supply Chain Manag. 5(1): 58-79 (2012) - 2011
- [j13]Rodolfo G. Dondo, Carlos A. Méndez, Jaime Cerdá:
The multi-echelon vehicle routing problem with cross docking in supply chain management. Comput. Chem. Eng. 35(12): 3002-3024 (2011) - 2010
- [j12]Diego C. Cafaro, Jaime Cerdá:
Operational scheduling of refined products pipeline networks with simultaneous batch injections. Comput. Chem. Eng. 34(10): 1687-1704 (2010) - 2009
- [j11]Rodolfo G. Dondo, Jaime Cerdá:
A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Comput. Chem. Eng. 33(2): 513-530 (2009) - [j10]Pablo A. Marchetti, Jaime Cerdá:
A general resource-constrained scheduling framework for multistage batch facilities with sequence-dependent changeovers. Comput. Chem. Eng. 33(4): 871-886 (2009) - 2008
- [j9]Diego C. Cafaro, Jaime Cerdá:
Dynamic scheduling of multiproduct pipelines with multiple delivery due dates. Comput. Chem. Eng. 32(4-5): 728-753 (2008) - [j8]Rodolfo G. Dondo, Carlos A. Méndez, Jaime Cerdá:
Optimal management of logistic activities in multi-site environments. Comput. Chem. Eng. 32(11): 2547-2569 (2008) - 2007
- [j7]Rodolfo G. Dondo, Jaime Cerdá:
A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176(3): 1478-1507 (2007) - 2006
- [j6]Carlos A. Méndez, Jaime Cerdá, Ignacio E. Grossmann, Iiro Harjunkoski, Marco Fahl:
State-of-the-art review of optimization methods for short-term scheduling of batch processes. Comput. Chem. Eng. 30(6-7): 913-946 (2006) - [j5]Rodolfo G. Dondo, Jaime Cerdá:
A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows. Int. Trans. Oper. Res. 13(5): 441-459 (2006) - 2004
- [j4]Carlos A. Méndez, Jaime Cerdá:
An MILP framework for batch reactive scheduling with limited discrete resources. Comput. Chem. Eng. 28(6-7): 1059-1068 (2004) - [j3]Diego C. Cafaro, Jaime Cerdá:
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation. Comput. Chem. Eng. 28(10): 2053-2068 (2004) - 2003
- [j2]Carlos A. Méndez, Jaime Cerdá:
Dynamic scheduling in multiproduct batch plants. Comput. Chem. Eng. 27(8-9): 1247-1259 (2003) - 2002
- [j1]Carlos A. Méndez, Jaime Cerdá:
An MILP-based approach to the short-term scheduling of make-and-pack continuous production plants. OR Spectr. 24(4): 403-429 (2002)
Conference and Workshop Papers
- 2011
- [c2]Isidro I. Lázaro, J. Jesús Rico, Jaime Cerdá, J. Maldonado:
QSSSEPS - A MATLAB-Based Quasi-Stationary State Simulator for Electrical Power Systems. ICSEng 2011: 91-95 - 2010
- [c1]Vanina G. Cafaro, Diego C. Cafaro, Carlos A. Méndez, Jaime Cerdá:
Oil-derivatives pipeline logistics using discrete-event simulation. WSC 2010: 2101-2113
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-26 18:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
