Adenso-Daz Belarmino

Belarmino Adenso-Daz

Information about the author Belarmino Adenso-Daz will soon be added to the site.
Found 12 papers in total
A beam search approach for the optimization version of the car sequencing problem
2008
The Car Sequencing Problem (CSP) is a feasibility problem that has attracted the...
A model for the design of dedicated manufacturing cells
2008
In this paper, a new cellular manufacturing design approach is proposed based on the...
Lot sizing in reverse MRP for scheduling disassembly
2008
Gupta and Taleb presented an algorithm for reverse MRP that can be applied to a...
A GRASP approach for the extended car sequencing problem
2008
This paper presents a solution procedure for a new variant of the Car Sequencing...
Fine-tuning of algorithms using fractional experimental designs and local search
2006
Researchers and practitioners frequently spend more time fine-tuning algorithms than...
A scatter search approach to the optimum disassembly sequence problem
2006
One of the most difficult problems faced by OR researchers in the reverse logistics...
An empirical investigation on parallelization strategies for Scatter Search
2006
As other metaheuristics, Scatter Search can gain from a parallel implementation....
Machine cell formation in generalized group technology
2001
In this paper, we study the configuration of machine cells in the presence of...
A hierarchical approach to managing dairy routing
1998
We designed and implemented a decision support system to organize the delivery network...
A simple search heuristic for the maximal covering location problem: Application to the location of ambulance bases in a rural region
1997
In the location of ambulance bases for medical assistance, an adequate time of...
A simulated annealing and tabu search mixture algorithm for the scheduling tardiness problem
1996
In the daily activity of workshops the problem of minimizing delay in dispatching is...
Restricted neighborhood in the tabu search for the flowshop problem
1992
This paper deals with the minimizing weighted tardiness of jobs in a scheduling...
Papers per page: