PRIORITIZATION OF KANBANS IN THE CASE OF A SINGLE STATION SERVING MULTIPLE DOWNSTREAM STATIONS

When implementing the kanban method in non-serial production lines, an interesting prioritization problem arises. Often a single server stat ion will be linked with M different downstream stations via M separate kanban loops. Then the K-priority problem may be described as determi ning which kanban card should be processed next, given that empty card s are waiting in more than one loop. The objective in prioritizing the kanbans is to reduce back order or shortage costs and inventory costs at the downstream stations. Utilizing the theory of Markovian decisio n process and dynamic programming concepts, a solution to the K-priori ty problem is developed. This solution is labelled the K-rule, and was found to outperform the first-come-first-served and longest queue rul es, plus a cost inclusive heuristic rule, in experimental tests.