Jaime Cano Belmán

Jaime Cano Belmán
University of Hohenheim · Institute of Interorganisational Management & Performance

Dr.

About

16
Publications
2,392
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
153
Citations
Introduction
Jaime Cano Belmán currently works as Consultant at SimPlan AG. Jaime has made research in Industrial Engineering, Supply Chain Management and Industrial Organization applying Operations Research Methods like Mathematical Optimization and Simulation. His last research project, Demand Fulfillment in multi-stage customer hierarchies, has been supported by the German Research Funfation (DFG).
Additional affiliations
October 2011 - August 2014
EBS University of Business and Law
Position
  • Researcher
Description
  • Supply Chain Planning. Demand Fulfillment in Networks. Dynamic and Seamless Integration of Production, Logistics, and Transportation

Publications

Publications (16)
Article
In manufacturing environments with heterogeneous (e.g., because of different profit margins) customers the optimal matching of available supply with dynamic demand is a challenging task as soon as supply becomes scarce. In Make-to-Stock systems, Demand Fulfillment first allocates these scarce resources (in form of Available-to-Promise — ATP) to cus...
Article
Full-text available
A commercial territory design problem with compactness maximization criterion subject to territory balancing and connectivity is addressed. Four new heuristics based on Greedy Randomized Adaptive Search Procedures within a location-allocation scheme for this NP-hard combinatorial optimization problem are proposed. The first three (named GRLH1, GRLH...
Article
Full-text available
We address a mixed-model assembly-line sequencing problem with¡ the goal of minimizing work overload. We consider time windows in work stations of the assembly line (closed stations) and different versions of a product to be assembled in the line (e.g., automotive industry), which require different processing time according to the work required in...
Conference Paper
Full-text available
Se presenta una hiperheurística para el problema de secuenciación de modelos mixtos en líneas de montaje. El criterio de secuenciación es la minimización de la sobrecarga producida en las estaciones de la línea de montaje debido a las diferentes cantidades de trabajo necesarias para procesar diferentes versiones de los productos. Secuencias largas...
Article
A variant of the mixed-model sequencing problem on assembly lines is the one proposed by Yano and Rachamadugu in 1991. They consider time windows in workstations and the work overload concept-sum of differences between real completion time in the workstation and due dates, which depends on the time window value. This paper proposes some procedures...
Conference Paper
Full-text available
Resumen—Se consideran una variante del problema de secuenciación de unidades en líneas de montaje en contexto JIT. El criterio es la minimización de la sobrecarga. Se proponen algunas heurísticas que buscan el orden en que se introducirán los diferentes variantes de un mismo producto en una estación. Se toma de la literatura un procedimiento para v...
Conference Paper
Full-text available
There are different approaches for the mixed-model assembly-lines sequencing problem. In this paper the goal of minimizing work overload is treated. This approach considers the existence of time windows in each work station. Different versions of a product are considered to be assembled in the line (e.g. car industry), which require different proce...
Thesis
Full-text available
The object of this thesis is the Mixed-model Assembly-line Sequencing problem, Assembly lines have become a core component in modern repetitive manufacturing systems, especially in Just in Time production systems. Sequencing problems are important for the efficient use of mixed-model assembly lines. The sequencing for such lines entails the determi...
Conference Paper
Full-text available
There are different approaches for the mixed model sequencing problem on assembly lines. In this paper the goal of minimizing work overload is treated. Since solve this problem optimally is difficult, we test c onstructive procedures, local search and a new hiperheuristic procedure.
Conference Paper
Full-text available
A variant of the mixed-model sequencing problem on assembly lines is the one proposed by Yano and Rachamadugu. They consider time windows in workstations and the work overload concept (sum of differences between real completion time in the workstation and due dates, which depends on the time window value). This paper proposes some procedures for so...
Conference Paper
Full-text available
La secuenciación de unidades en líneas de montaje de productos mixtos puede atender a diversos criterios; uno de ellos es el que consiste en minimizar la sobrecarga o trabajo perdido. En el presente trabajo proponemos heurísticas para el caso general con n variantes de un producto y m estaciones de trabajo y probamos la eficiencia de dichos procedi...
Article
The objective of a beverage distribution company is to build compact territories from a series of geographical units (city blocks) sub-ject to multiple node activity balancing requirements, and contiguity constraints. Existing approaches are based on a Euclidean distance me-tric. In this work we introduce a dispersion measure based on network dista...
Article
RESUMEN Una variante del problema de secuenciación de productos mixtos en una línea de montaje es la propuesta por Yano y Rachamadugu. En ella se considera la existencia de ventanas temporales en las estaciones de trabajo y el concepto de trabajo perdido (suma de las diferencias entre los instantes reales de compleción de las unidades en las estaci...

Network

Cited By