Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W

In this paper, we propose a hybrid procedure based on Bounded Dynamic Programming (BDP) and linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization (MMSP-W), with serial workstations, free interruption of the operations and production mix restrictions. We performed...

Descripción completa

Detalles Bibliográficos
Autores: Bautista Valhondo, Joaquín|||0000-0002-2214-4991, Cano Pérez, Alberto, Alfaro Pozo, Rocío|||0000-0001-8214-1875, Batalla García, Cristina
Tipo de recurso: artículo
Fecha de publicación:2013
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/89826
Acceso en línea:https://hdl.handle.net/2117/89826
https://dx.doi.org/10.3182/20130619-3-RU-3018.00237
Access Level:acceso abierto
Palabra clave:Heuristic algorithms
Automobile industry
Manufacturing systems
JIT manufacturing
Sequences
Overload
Scheduling algorithms
Dynamic programming
Linear programming
Heuristics
Programació dinàmica
Heurística
Optimització matemàtica
Àrees temàtiques de la UPC::Economia i organització d'empreses
Descripción
Sumario:In this paper, we propose a hybrid procedure based on Bounded Dynamic Programming (BDP) and linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization (MMSP-W), with serial workstations, free interruption of the operations and production mix restrictions. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the Gurobi solver and previous procedures.

Similares en LA Referencia