Production planning for a multi-item, single-stage kanban system

M. G. Mitwasi, Ronald Askin

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

The kanban production authorization system has been widely implemented as a control scheme for just-in-time manufacturing. This system is normally applied in systems with reliable processes, low setup times, static demand and excess capacity. The use of kanbans avoids the need for complex information and hierarchical control systems on the shop floor. Kanban control also has the advantage of reacting quickly to minor demand changes. In this paper we investigate the use of kanban control at workcentres which produce multiple items with dynamic, random demand. The dynamic aspects of demand may cause temporary capacity shortages. The kanban control system automatically reacts quickly to the random aspects of demand. Selection of the number of kanbans will accommodate the dynamic aspect. We assume an environment with low setup times and a desire for rapid adjustment in production rates to match demand. A mathematical model for the problem is defined and shown to reduce to a simpler problem. Using the simpler problem, we investigate necessary and sufficient conditions for feasibility of the problem and specific choices of kanban levels. These conditions are used to define upper and lower bounds on the optimal number of kanbans which, in turn, are employed for developing optimal and near-optimal, heuristic algorithms for selecting kanban levels for each item. An algorithm is also derived for finding feasible production schedules given a feasible set of kanbans. The algorithm provides a policy which is easily implemented on the shop floor for guiding production decisions when capacity is limited. The methodology is illustrated with an example and results of experimental testing of the algorithm and heuristic are presented.

Original languageEnglish (US)
Pages (from-to)1173-1195
Number of pages23
JournalInternational Journal of Production Research
Volume32
Issue number5
StatePublished - May 1994

Fingerprint

Planning
Control systems
Heuristic algorithms
Mathematical models
Kanban
Production planning
Testing

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

Production planning for a multi-item, single-stage kanban system. / Mitwasi, M. G.; Askin, Ronald.

In: International Journal of Production Research, Vol. 32, No. 5, 05.1994, p. 1173-1195.

Research output: Contribution to journalArticle

@article{007789f3b42546ff84364746dfa797f3,
title = "Production planning for a multi-item, single-stage kanban system",
abstract = "The kanban production authorization system has been widely implemented as a control scheme for just-in-time manufacturing. This system is normally applied in systems with reliable processes, low setup times, static demand and excess capacity. The use of kanbans avoids the need for complex information and hierarchical control systems on the shop floor. Kanban control also has the advantage of reacting quickly to minor demand changes. In this paper we investigate the use of kanban control at workcentres which produce multiple items with dynamic, random demand. The dynamic aspects of demand may cause temporary capacity shortages. The kanban control system automatically reacts quickly to the random aspects of demand. Selection of the number of kanbans will accommodate the dynamic aspect. We assume an environment with low setup times and a desire for rapid adjustment in production rates to match demand. A mathematical model for the problem is defined and shown to reduce to a simpler problem. Using the simpler problem, we investigate necessary and sufficient conditions for feasibility of the problem and specific choices of kanban levels. These conditions are used to define upper and lower bounds on the optimal number of kanbans which, in turn, are employed for developing optimal and near-optimal, heuristic algorithms for selecting kanban levels for each item. An algorithm is also derived for finding feasible production schedules given a feasible set of kanbans. The algorithm provides a policy which is easily implemented on the shop floor for guiding production decisions when capacity is limited. The methodology is illustrated with an example and results of experimental testing of the algorithm and heuristic are presented.",
author = "Mitwasi, {M. G.} and Ronald Askin",
year = "1994",
month = "5",
language = "English (US)",
volume = "32",
pages = "1173--1195",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - Production planning for a multi-item, single-stage kanban system

AU - Mitwasi, M. G.

AU - Askin, Ronald

PY - 1994/5

Y1 - 1994/5

N2 - The kanban production authorization system has been widely implemented as a control scheme for just-in-time manufacturing. This system is normally applied in systems with reliable processes, low setup times, static demand and excess capacity. The use of kanbans avoids the need for complex information and hierarchical control systems on the shop floor. Kanban control also has the advantage of reacting quickly to minor demand changes. In this paper we investigate the use of kanban control at workcentres which produce multiple items with dynamic, random demand. The dynamic aspects of demand may cause temporary capacity shortages. The kanban control system automatically reacts quickly to the random aspects of demand. Selection of the number of kanbans will accommodate the dynamic aspect. We assume an environment with low setup times and a desire for rapid adjustment in production rates to match demand. A mathematical model for the problem is defined and shown to reduce to a simpler problem. Using the simpler problem, we investigate necessary and sufficient conditions for feasibility of the problem and specific choices of kanban levels. These conditions are used to define upper and lower bounds on the optimal number of kanbans which, in turn, are employed for developing optimal and near-optimal, heuristic algorithms for selecting kanban levels for each item. An algorithm is also derived for finding feasible production schedules given a feasible set of kanbans. The algorithm provides a policy which is easily implemented on the shop floor for guiding production decisions when capacity is limited. The methodology is illustrated with an example and results of experimental testing of the algorithm and heuristic are presented.

AB - The kanban production authorization system has been widely implemented as a control scheme for just-in-time manufacturing. This system is normally applied in systems with reliable processes, low setup times, static demand and excess capacity. The use of kanbans avoids the need for complex information and hierarchical control systems on the shop floor. Kanban control also has the advantage of reacting quickly to minor demand changes. In this paper we investigate the use of kanban control at workcentres which produce multiple items with dynamic, random demand. The dynamic aspects of demand may cause temporary capacity shortages. The kanban control system automatically reacts quickly to the random aspects of demand. Selection of the number of kanbans will accommodate the dynamic aspect. We assume an environment with low setup times and a desire for rapid adjustment in production rates to match demand. A mathematical model for the problem is defined and shown to reduce to a simpler problem. Using the simpler problem, we investigate necessary and sufficient conditions for feasibility of the problem and specific choices of kanban levels. These conditions are used to define upper and lower bounds on the optimal number of kanbans which, in turn, are employed for developing optimal and near-optimal, heuristic algorithms for selecting kanban levels for each item. An algorithm is also derived for finding feasible production schedules given a feasible set of kanbans. The algorithm provides a policy which is easily implemented on the shop floor for guiding production decisions when capacity is limited. The methodology is illustrated with an example and results of experimental testing of the algorithm and heuristic are presented.

UR - http://www.scopus.com/inward/record.url?scp=0028439455&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028439455&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0028439455

VL - 32

SP - 1173

EP - 1195

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 5

ER -