Hector J. Carlo

Hector J. Carlo

Auto-generated profile, based on publicly available information

Hector J. Carlo

University of Puerto Rico – Mayagüez

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
HCHéctor J. Carlo
Héctor J. Carlo
IVIris F.A. Vis
Iris F.A. Vis
KRKees Jan Roodbergen
Kees Jan Roodbergen

1 July 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
HCHéctor J. Carlo
Héctor J. Carlo
IVIris F.A. Vis
Iris F.A. Vis
KRKees Jan Roodbergen
Kees Jan Roodbergen

2 June 2013 in Flexible Services and Manufacturing Journal
Verified
Journal Article
Closed access
PDF file
HCHéctor J. Carlo
Héctor J. Carlo
IVIris F. A. Vis
Iris F. A. Vis
KRKees Jan Roodbergen
Kees Jan Roodbergen

1 December 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
PBPaul Buijs
Paul Buijs
IVIris F.A. Vis
Iris F.A. Vis
HCHéctor J. Carlo
Héctor J. Carlo

1 December 2012 in International Journal of Production Economics
Verified
Journal Article
Closed access
HCHéctor J. Carlo
Héctor J. Carlo
IVIris F.A. Vis
Iris F.A. Vis

1 May 2010 in Transportation Science
Verified
Journal Article
Closed access
IVIris F. A. Vis
Iris F. A. Vis
HCHector J. Carlo
Hector J. Carlo
The containerized trade market is growing rapidly with the uprising of the Far East. Container ports worldwide should be responsive by developing tools to handle these massive volumes of containers in order to retain their level of competitiveness. One of the areas in a container terminal that is highly affected by the increase in the demand of containers is the stack. The stack is used to temporarily store containers upon further transport to their destination. This study is concerned with scheduling sea and landside storages and retrievals in a stack with two cooperating automated stacking cranes working in a single block. We present a mathematical model to minimize the makespan for both cranes. Both an algorithm to derive a lower bound for the makespan and a simulated-annealing based heuristic are proposed to efficiently solve the problem. Numerical experiments show that the solutions of the heuristic method are within 2% of the lower bound for large instances.