JIT: Just In Time / Douki Seisan sequencing
A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
Authors
Joaquin Bautista1, Alberto Cano1 and Rocío Alfaro1
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.
