Aportaciones a problemas de secuencias en entornos productivos JiT mediante procedimientos heurísticos, exactos e híbridos

Resumen

This thesis, entitled "Contributions to sequencing problems in JiT productive environments using heuristic, exact and hybrid procedures" consists of three publications that address the resolution of job sequencing problems in Just-in-Time productive systems. Firstly, an exact Branch-and-Bound based procedure is presented for solving the simple assembly line balancing problem (SALBP). Secondly, a different Branch-and-Bound based procedure is applied to the assembly line worker assignment and balancing problem (ALWABP). Lastly, a heuristic procedure and an exact algorithm are devised for solving the one machine scheduling problem with earliness and tardiness penalties. All of the presented procedures obtain good results in their respective computational experiments and provide new methodologies that can be applied to similar problems.