Effect of buffer capacity and sequencing rules on single-card kanban system performance

Abstract

Abstract One of the basic tenets of scheduling theory is that the shortest-processing-time (SPT) sequencing rule maximizes average production rates and minimizes average in-process inventories. This paper shows that on single-card kanban-controlled lines the relative performance of first come, first served (FCFS) and SPT changes with processing time variability and station input buffer capacities. FCFS has greater average production rates when processing times are normal and input buffer capacities are large. SPT has greater average production rates when processing times are exponential and input buffer capacities are small.