Solving the Fm|block|Cmax problem using bounded dynamic programming

We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm|block|Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard's instances, including the 10 instances from set 12.Preprin

Incorporating working conditions to a mixed- model sequencing problem

Partiendo de una variante de un problema de secuenciación en líneas de productos mixtos (MMSP-W: Mixed-Model Sequencing Problem with Workload Minimisation), se proponen dos nuevos modelos que incorporan condiciones laborales a los puestos de trabajo de la línea. El primero tiene en cuenta la limitación de la saturación de los puestos de trabajo, mientras que el segundo contempla, además, la activación de los operarios a lo largo de la jornada laboral. Se realizan sendas experiencias computacionales, empleando un caso de estudio de la planta de motores de Nissan en Barcelona, con dos propósitos: (1) estudiar la repercusión que ocasiona la limitación de la saturación sobre la caída de la productividad de la línea, y (2) evaluar la recuperación de la productividad de la línea, mediante la activación de los operarios, manteniendo la misma calidad en las condiciones laborales conseguida al limitar la saturación.Beginning with a variation of the sequencing problem in a mixed-products line (MMSP-W: Mixed-Model Sequencing Problem with Workload Minimization), we propose two new models that incorporate the working conditions into the workstations on the line. The first model takes into account the saturation limit of the workstations, and the second model also includes the activation of the operators throughout the working day. Two computational experiments were carried out using a case study of the Nissan motor plant in Barcelona with two main objectives: (1) to study the repercussions of the saturation limit on the decrease in productivity on the line and (2) to evaluate the recovery of productivity on the line via activation of operators while maintaining the same quality in working conditions achieved by limiting the saturation. The obtained results show that the saturation limitation leads to suppose an important increase of work overload, which means average economic losses of 28,731.8 euros/day. However, the consideration of activity reduces these losses by 62.7%.Preprin

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

This is a post-peer-review, pre-copyedit version of an article published in Central european journal of operations research. The final authenticated version is available online at: http://www.doi.org/10.1007/s10100-018-0553-8This paper presents two mixed integer linear programming (MILP) models that extend two basic Flow Shop Scheduling problems: Fm/prmu/Cmax and Fm/block/Cmax. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan’s plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan.Peer ReviewedPostprint (published version

Transformación de una línea de montaje de modelos mixtos en un taller de flujo regular: Caso de estudio en la factoría Nissan de Barcelona

En este trabajo aplicamos dos modelos de Programación lineal entera mixta, sobre problemas de taller de flujo regular con demanda generalizada de tipos de trabajos, con el propósito de transformar una línea de modelos mixtos en un taller de flujo regular. Para ilustrar dicha aplicación, presentamos un caso de estudio basado en una línea de motores mixtos de la factoría de Nissan en Barcelona. En el estudio se comparan los costes de producción de los dos sistemas productivos enfrentados, llegando a la conclusión de que el sistema taller de flujo regular sin bloqueos entre estaciones es el más competitivo. Como herramienta de resolución hemos empleado el solucionador CPLEX con resultados satisfactorios. Para llevar a la práctica la transformación de la línea de producción en un taller de flujo regular, proponemos un conjunto de requisitos, así como la asistencia al sistema productivo con un sistema de información basado en tecnologías IoT en el marco de la Industria 4.0.Postprint (author's final draft

Consideration of human resources in the Mixed-model Sequencing Problem with Work Overload Minimization: Legal provisions and productivity improvement

Beginning with a variation of the sequencing problem in a mixed-products line (MMSP-W: Mixed-Model Sequencing Problem with Workload Minimization), we propose two new models that incorporate a set of working conditions in regard with human resources of workstations on the line. These conditions come from collective agreements and therefore must be respected by both company and labor unions. The first model takes into account the saturation limit of the workstations, and the second model also includes the activation of the operators throughout the working day. Two computational experiments were carried out using a case study of the Nissan motor plant in Barcelona with two main objectives: (1) to study the repercussions of the saturation limit on the decrease in productivity on the line and (2) to evaluate the recovery of productivity on the line via both activation of operators, while maintaining the same quality in working conditions achieved by limiting the saturation, and auxiliary processors. By results we state that saturation limitation leads an important increase of work overload, which means average economic losses of 28,731.8 Euros/day. However, the productivity reduction may be counteracted by the work pace factor increase, at certain moments of workday, and/or by the incorporation of auxiliary processors into the line.Postprint (author's final draft

Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

In this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs (Cmax) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of € 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.Peer ReviewedPostprint (published version

Secuenciación con Almacenes Limitados. Una Revisión de la Literatura

[ES] Tradicionalmente, en la aproximación formal a la secuenciación de producción denominada en inglés Theory of Scheduling (o simplemente scheduling), se suele obviar la limitación de capacidad entre los diferentes recursos de cara a establecer el programa de producción. Sin embargo, el paradigma Lean Manufacturing ha dejado patente que la limitación de capacidad física en los sistemas productivos es una característica que influye en los resultados de los programas de producción, por lo que las configuraciones empezando a ser objeto de estudio en la dirección de operaciones. En este artículo se hace una revisión de las principales características de la secuenciación con almacenes limitados que se han abordado bajo la teoría de secuenciación y se resumen las referencias más importantes publicadas durante los últimos años. Finalmente, se presentan una serie de conclusiones con el objetivo de clarificar algunas líneas de interés para los investigadores del tema.Andrés Romano, C.; Maheut, J. (2018). Secuenciación con Almacenes Limitados. Una Revisión de la Literatura. Dirección y organización (Online). 66:17-33. http://hdl.handle.net/10251/145863S17336

Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times

This paper aims at presenting an algorithm for solving the blocking flow shop problem with sequence dependent setup times (BFSP-SDST) with minimization of the makespan. In order to do so, we propose an adapted Bounded Dynamic Programming (BDP-SN) algorithm as solution method, since the problem itself does not present a significant number of sources in the state-of-art references and also because Dynamic Programming and its variants have been resurfacing in the flowshop literature. Therefore, we apply the modified method to two sets of problems and compare the results computationally and statistically for instances with a MILP and a B&B method for at most 20 jobs and 20 machines. The results show that BDP-SN is promising and outperforms both MILP and B&B within the established time limit. In addition, some suggestions are made in order to improve the method and employ it in parallel research regarding other branches of machine scheduling

Solving the Fm|block|Cmax problem using bounded dynamic programming

We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm|block|Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard's instances, including the 10 instances from set 12