Arrival first queueing networks with applications in kanban production systems

R.J. Boucherie, X. Chao, M. Miyazawa

Research output: Book/ReportReportOther research output

41 Downloads (Pure)

Abstract

In this paper we introduce a new class of queueing networks called {\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production systems operating under a kanban protocol. In contrast with the conventional {\em departure first networks}, where a transition is initiated by service completion of items at the originating nodes that are subsequently routed to the destination nodes (push system), in an arrival first network a transition is initiated by the destination nodes of the items and subsequently those items are processed at and removed from the originating nodes (pull system). These are similar to the push and pull systems in manufacturing systems.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Faculty of Mathematical Sciences
Number of pages22
Publication statusPublished - 2001

Publication series

NameMemorandum / Faculty of Mathematical Sciences
PublisherUniversity of Twente, Faculty of Mathematical Sciences
No.1590
ISSN (Print)0169-2690

Keywords

  • MSC-60J27
  • IR-65777
  • EWI-3410
  • MSC-60K25

Cite this

Boucherie, R. J., Chao, X., & Miyazawa, M. (2001). Arrival first queueing networks with applications in kanban production systems. (Memorandum / Faculty of Mathematical Sciences; No. 1590). Enschede: University of Twente, Faculty of Mathematical Sciences.
Boucherie, R.J. ; Chao, X. ; Miyazawa, M. / Arrival first queueing networks with applications in kanban production systems. Enschede : University of Twente, Faculty of Mathematical Sciences, 2001. 22 p. (Memorandum / Faculty of Mathematical Sciences; 1590).
@book{5e4e110d88b846f1ad74cbe05d8b6d37,
title = "Arrival first queueing networks with applications in kanban production systems",
abstract = "In this paper we introduce a new class of queueing networks called {\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production systems operating under a kanban protocol. In contrast with the conventional {\em departure first networks}, where a transition is initiated by service completion of items at the originating nodes that are subsequently routed to the destination nodes (push system), in an arrival first network a transition is initiated by the destination nodes of the items and subsequently those items are processed at and removed from the originating nodes (pull system). These are similar to the push and pull systems in manufacturing systems.",
keywords = "MSC-60J27, IR-65777, EWI-3410, MSC-60K25",
author = "R.J. Boucherie and X. Chao and M. Miyazawa",
note = "Imported from MEMORANDA",
year = "2001",
language = "Undefined",
series = "Memorandum / Faculty of Mathematical Sciences",
publisher = "University of Twente, Faculty of Mathematical Sciences",
number = "1590",

}

Boucherie, RJ, Chao, X & Miyazawa, M 2001, Arrival first queueing networks with applications in kanban production systems. Memorandum / Faculty of Mathematical Sciences, no. 1590, University of Twente, Faculty of Mathematical Sciences, Enschede.

Arrival first queueing networks with applications in kanban production systems. / Boucherie, R.J.; Chao, X.; Miyazawa, M.

Enschede : University of Twente, Faculty of Mathematical Sciences, 2001. 22 p. (Memorandum / Faculty of Mathematical Sciences; No. 1590).

Research output: Book/ReportReportOther research output

TY - BOOK

T1 - Arrival first queueing networks with applications in kanban production systems

AU - Boucherie, R.J.

AU - Chao, X.

AU - Miyazawa, M.

N1 - Imported from MEMORANDA

PY - 2001

Y1 - 2001

N2 - In this paper we introduce a new class of queueing networks called {\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production systems operating under a kanban protocol. In contrast with the conventional {\em departure first networks}, where a transition is initiated by service completion of items at the originating nodes that are subsequently routed to the destination nodes (push system), in an arrival first network a transition is initiated by the destination nodes of the items and subsequently those items are processed at and removed from the originating nodes (pull system). These are similar to the push and pull systems in manufacturing systems.

AB - In this paper we introduce a new class of queueing networks called {\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production systems operating under a kanban protocol. In contrast with the conventional {\em departure first networks}, where a transition is initiated by service completion of items at the originating nodes that are subsequently routed to the destination nodes (push system), in an arrival first network a transition is initiated by the destination nodes of the items and subsequently those items are processed at and removed from the originating nodes (pull system). These are similar to the push and pull systems in manufacturing systems.

KW - MSC-60J27

KW - IR-65777

KW - EWI-3410

KW - MSC-60K25

M3 - Report

T3 - Memorandum / Faculty of Mathematical Sciences

BT - Arrival first queueing networks with applications in kanban production systems

PB - University of Twente, Faculty of Mathematical Sciences

CY - Enschede

ER -

Boucherie RJ, Chao X, Miyazawa M. Arrival first queueing networks with applications in kanban production systems. Enschede: University of Twente, Faculty of Mathematical Sciences, 2001. 22 p. (Memorandum / Faculty of Mathematical Sciences; 1590).