JIT: Just In Time / Douki Seisan sequencing

  • Modeling and Solving a Variant of MMSP-W Problem with Production Mix Restrictions



Joaquin Bautista1, Alberto Cano1 and Rocío Alfaro1


1 UPC - Nissan Chair


In this paper, we propose a procedure based on Bounded Dynamic Programming (BDP) to solve the Mixed-Model Sequencing Problem with Work overload Minimisation (MMSP-W), with serial workstations, unrestricted (or free) interruption ofthe operations and with production mix restrictions.

Return to previous page