Cristina Batalla-García

Learn More
A GRASP algorithm is presented for solving a sequencing problem in a mixed-model assembly line. The problem is focused on obtaining a manufacturing sequence that completes the greatest possible amount of required work and fulfils the production regularity property. The implemented GRASP algorithm is compared with other resolution procedures by means of(More)
In this article, we propose a hybrid procedure based on bounded dynamic programming (BDP) assisted by linear programming to solve the mixed-model sequencing problem with workload minimization (MMSP-W) with serial workstations, free interruption of the operations and with production mix restrictions. We performed a computational experiment with 23 instances(More)
An error has slipped in the Appendix. In the definitions of the variables z + i,t and z − i,t the right texts are: z + i,t Binary variable equal to 1 if X i,t (i ∈ I, t = 1,. .. , T) is greater than the upper limit of production mix preservation and to 0 otherwise z − i,t Binary variable equal to 1 if X i,t (i ∈ I, t = 1,. .. , T) is less than the lower(More)
  • 1