DocumentCode
2913512
Title
A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
Author
Bautista, Joaquin ; Cano, Alberto ; Alfaro, Rocío
Author_Institution
ETSEIB, UPC, Barcelona, Spain
fYear
2011
fDate
22-24 Nov. 2011
Firstpage
289
Lastpage
294
Abstract
In this paper, we propose a procedure based on Bounded Dynamic Programming (BDP) to solve the Mixed-Model Sequencing Problem with Workload Minimisation (MMSP-W), with serial workstations and unrestricted (or free) interruption of the operations. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the CPLEX solver.
Keywords
dynamic programming; minimisation; production control; BDP; CPLEX solver; MMSP-W; bounded dynamic programming algorithm; mixed-model sequencing problem with workload minimisation; serial workstations; unrestricted interruption; workstation dependencies; Computational modeling; Dynamic programming; Heuristic algorithms; Intelligent systems; Minimization; Vectors; Workstations; Dynamic; Scheduling; sequencing; work overload;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems Design and Applications (ISDA), 2011 11th International Conference on
Conference_Location
Cordoba
ISSN
2164-7143
Print_ISBN
978-1-4577-1676-8
Type
conf
DOI
10.1109/ISDA.2011.6121670
Filename
6121670
Link To Document