Reducing the Congestion in a Class of Job Shops

Abstract

Consider a job shop that is modelled as an open queueing network of the Jackson (Jackson, J. R. 1957. Networks of waiting lines. Oper. Res. 5 518–521.) type. All work stations in the shop have the same number of parallel servers. Two problems are studied: the loading of stations and the assignment of servers, which are represented by loading and assignment vectors, respectively. Majorization and arrangement orderings are established to order, respectively, the loading and the assignment vectors. It is shown that reducing the loading vector under majorization or increasing the assignment vector under arrangement ordering will reduce the congestion in the shop in terms of reducing the total number of jobs (in the sense of likelihood ratio ordering), the maximum queue length (in the sense of stochastic ordering), and the queue-length vector (in the sense of stochastic majorization). The results can be used to support production planning in certain job shops, and to aid the design of storage capacity.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 21 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.