José Manuel Tamarit

According to our database1, José Manuel Tamarit authored at least 25 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2000
2005
2010
2015
0
1
2
3
4
5
1
1
1
3
1
2
1
3
2
1
4
3
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
New exact methods for the time-invariant berth allocation and quay crane assignment problem.
Eur. J. Oper. Res., 2019

2017
Matheuristics for the irregular bin packing problem with free rotations.
Eur. J. Oper. Res., 2017

2016
Determining the best shipper sizes for sending products to customers.
Int. Trans. Oper. Res., 2016

2015
Lower bounds for three-dimensional multiple-bin-size bin packing problems.
OR Spectr., 2015

The continuous Berth Allocation Problem in a container terminal with multiple quays.
Expert Syst. Appl., 2015

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics.
Comput. Oper. Res., 2015

2013
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems.
Comput. Oper. Res., 2013

2010
Neighborhood structures for the container loading problem: a VNS implementation.
J. Heuristics, 2010

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing.
Ann. Oper. Res., 2010

2009
A branch and bound algorithm for the strip packing problem.
OR Spectr., 2009

2008
A Maximal-Space Algorithm for the Container Loading Problem.
INFORMS J. Comput., 2008

GRASP and path relinking for project scheduling under partially renewable resources.
Eur. J. Oper. Res., 2008

Reactive GRASP for the strip-packing problem.
Comput. Oper. Res., 2008

2007
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem.
INFORMS J. Comput., 2007

A tabu search algorithm for a two-dimensional non-guillotine cutting problem.
Eur. J. Oper. Res., 2007

2006
A scatter search algorithm for project scheduling under partially renewable resources.
J. Heuristics, 2006

2005
A tabu search algorithm for the pallet loading problem.
OR Spectr., 2005

A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems.
J. Oper. Res. Soc., 2005

A heuristic to schedule flexible job-shop in a glass factory.
Eur. J. Oper. Res., 2005

A branch-and-cut algorithm for the pallet loading problem.
Comput. Oper. Res., 2005

2002
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems.
OR Spectr., 2002

Design and implementation of a course scheduling system using Tabu Search.
Eur. J. Oper. Res., 2002

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems.
Comput. Oper. Res., 2002

2000
Assigning students to course sections using tabu search.
Ann. Oper. Res., 2000

1999
Labour scheduling at an airport refuelling installation.
J. Oper. Res. Soc., 1999


  Loading...