Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Scheduling Policies in Flexible Bernoulli Lines with Dedicated Finite Buffers

Published

Author(s)

Shaw C. Feng, Yuan Feng, Xiang Zhong, Wenhui Fan, Jingshan Li

Abstract

This paper is devoted to studying scheduling policies in flexible serial lines with two Bernoulli machines and dedicated finite buffers. Priority, cyclic and work-in-process (WIP)-based scheduling policies are investigated. For small scale systems, exact solutions are derived using Markov chain models. For larger ones, a flexible line is decomposed into multiple interacting dedicated serial lines, and iteration procedures are introduced to approximate system production rate. Through extensive numerical experiments, it is shown that the approximation methods result in acceptable accuracy in throughput esti- mation. In addition, system-theoretic properties such as asymptotic behav- ior, reversibility, and monotonicity, as well as impact of buffer capacities are discussed, and comparisons of the scheduling policies are carried out.
Citation
Journal of Manufacturing Systems

Keywords

Bernoulli reliability machine, flexibility, production rate, scheduling policy, dedicated buffer.production rate, key performance indicator.

Citation

Feng, S. , Feng, Y. , Zhong, X. , Fan, W. and Li, J. (2018), Scheduling Policies in Flexible Bernoulli Lines with Dedicated Finite Buffers, Journal of Manufacturing Systems, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=925003 (Accessed October 4, 2023)
Created July 2, 2018, Updated October 1, 2018