Dynamic programming solution to the batching problem in just-in-time flow-shops
Computers and Industrial Engineering
Operations Research Letters
Hi-index | 0.00 |
The commonly accepted objective for sequencing a mixed-model assembly line in a just-in-time (JIT) production system is to maintain a near-constant production rate for every model in the line. This article provides an extremely simple algorithm to solve this problem. The repeating property of the new algorithm is also given.