# American Institute of Mathematical Sciences

• Previous Article
Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm
• JIMO Home
• This Issue
• Next Article
Global and local advertising strategies: A dynamic multi-market optimal control model
July  2019, 15(3): 1049-1083. doi: 10.3934/jimo.2018085

## Optimization of a condition-based duration-varying preventive maintenance policy for the stockless production system based on queueing model

 College of information engineering, Shenzhen University, Shenzhen 518060, China

* Corresponding author: Jianyu Cao

Received  April 2016 Revised  March 2018 Published  July 2018

Fund Project: This work is supported by the National Natural Science Foundations of China (Grant Nos. 61401286, 61702341 and 61771319) and the Research Project of Shenzhen Technology University (Grant No. 201727).

A stockless production system is considered, in which the products are not produced until the orders are accepted. Due to this character, the duration of the preventive maintenance has an influence on the lead time. In addition, in this stockless production system, the cost of the preventive maintenance depends on its duration; if the lead time exceeds to the quoted lead time, some penalty cost should be considered; and the non-conforming products can still be sold by a discount. A condition-based duration-varying preventive maintenance policy is designed for the stockless production system, by making a tradeoff among the duration of the preventive maintenance, the time for the machine continuously producing, and the lead time of the order. According to the characters of the stockless production system with the designed preventive maintenance policy, it can be modeled by a BMAP/G/1 infinite-buffer queueing model with gated service and queue-length dependent vacation. Based on this queueing model, the stationary probability distributions of four performance measures for the stockless production system are analyzed, including, the number of the products produced in a production cycle, the number of the unfulfilled orders at arbitrary time, the time required to fulfill the tasks present at arbitrary time, and the lead time of the order accepted at arbitrary time. Moreover, based on some information of these performance measures, a profit function, which represents the average profit of the manufacture in a production cycle, is constructed to optimize the designed preventive maintenance policy according to specific conditions. Finally, given an example with the purchasers having different sensitivities to the lead time, some numerical experiments are carried out; and from the numerical experiments, some general results can be inferred for the stockless production system with the designed preventive maintenance policy.

Citation: Jianyu Cao, Weixin Xie. Optimization of a condition-based duration-varying preventive maintenance policy for the stockless production system based on queueing model. Journal of Industrial & Management Optimization, 2019, 15 (3) : 1049-1083. doi: 10.3934/jimo.2018085
##### References:

show all references

##### References:
${{K''}_t}\left\{ {\left. {\left( {i,v} \right) \times [0,x]} \right|\left( {{i_0},{v_0}} \right)} \right\}$ for ${{i}_{0}} = 0$, provided that at time $t$ $\left( t<{{T}_{1}} \right)$, a virtual customer arrives at the queue, while the server does not attend to the queue.
${{K''}_t}\left\{ {\left. {\left( {i,v} \right) \times [0,x]} \right|\left( {{i_0},{v_0}} \right)} \right\}$ for ${{i}_{0}}\ge 1$, provided that at time $t$ $\left( t<{{T}_{1}} \right)$, a virtual customer arrives at the queue, while the server does not attend to the queue.
${K''_t}\left\{ {\left. {\left( {i,v} \right) \times [0,x]} \right|\left( {{i_0},{v_0}} \right)} \right\}$ for $1\le {{i}_{0}}\le i$, provided that at time $t$ $\left( t<{{T}_{1}} \right)$, a virtual customer arrives at the queue, while the server is attending to the queue.
${K''_t}\left\{ {\left. {\left( {i,v} \right) \times [0,x]} \right|\left( {{i_0},{v_0}} \right)} \right\}$ for ${{i}_{0}}\ge 2$ and ${{i}_{0}}>i>0$, provided that at time $t$ $\left( t<{{T}_{1}} \right)$, a virtual customer arrives at the queue, while the server is attending to the queue.
Schematic diagrams of ${\varphi }(n)$, ${M_{c}}(x)$ and ${W_{c}}(x)$.
$\eta(q)$ vs. $q$ for the purchasers with different sensitivities to the lead time.
${{\sigma }_{m}}$ vs. $q$.
The correspondence between performance measures of the stockless production system and the queueing model
 The stockless production system The queueing model The number of the products produced in a production cycle The queue length just after the server travels to the queue The number of the unfulfilled orders at arbitrary time The queue length (including the customer in service) at arbitrary time The time required to fulfill the tasks 1 present at arbitrary time The virtual waiting time2 at arbitrary time The lead time of the order accepted at arbitrary time The actual waiting time3 at arbitrary time 1 The tasks contain the future or remaining machine set-up, machine close-down as well as PM (or the idle period) in the current production cycle, and the present unfulfilled orders.2 The definition of the virtual waiting time is given in Section 5.3 The definition of the actual waiting time is given in Section 6.
 The stockless production system The queueing model The number of the products produced in a production cycle The queue length just after the server travels to the queue The number of the unfulfilled orders at arbitrary time The queue length (including the customer in service) at arbitrary time The time required to fulfill the tasks 1 present at arbitrary time The virtual waiting time2 at arbitrary time The lead time of the order accepted at arbitrary time The actual waiting time3 at arbitrary time 1 The tasks contain the future or remaining machine set-up, machine close-down as well as PM (or the idle period) in the current production cycle, and the present unfulfilled orders.2 The definition of the virtual waiting time is given in Section 5.3 The definition of the actual waiting time is given in Section 6.
 [1] Pikkala Vijaya Laxmi, Obsie Mussa Yesuf. Analysis of a finite buffer general input queue with Markovian service process and accessible and non-accessible batch service. Journal of Industrial & Management Optimization, 2010, 6 (4) : 929-944. doi: 10.3934/jimo.2010.6.929 [2] A. Azhagappan, T. Deepa. Transient analysis of N-policy queue with system disaster repair preventive maintenance re-service balking closedown and setup times. Journal of Industrial & Management Optimization, 2020, 16 (6) : 2843-2856. doi: 10.3934/jimo.2019083 [3] Tien-Yu Lin. Effect of warranty and quantity discounts on a deteriorating production system with a Markovian production process and allowable shortages. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020013 [4] Wenjuan Zhao, Shunfu Jin, Wuyi Yue. A stochastic model and social optimization of a blockchain system based on a general limited batch service queue. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020049 [5] Zsolt Saffer, Wuyi Yue. A dual tandem queueing system with GI service time at the first queue. Journal of Industrial & Management Optimization, 2014, 10 (1) : 167-192. doi: 10.3934/jimo.2014.10.167 [6] Zsolt Saffer, Miklós Telek. Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network. Journal of Industrial & Management Optimization, 2011, 7 (3) : 677-697. doi: 10.3934/jimo.2011.7.677 [7] Javad Taheri-Tolgari, Mohammad Mohammadi, Bahman Naderi, Alireza Arshadi-Khamseh, Abolfazl Mirzazadeh. An inventory model with imperfect item, inspection errors, preventive maintenance and partial backlogging in uncertainty environment. Journal of Industrial & Management Optimization, 2019, 15 (3) : 1317-1344. doi: 10.3934/jimo.2018097 [8] Tao Jiang, Liwei Liu. Analysis of a batch service multi-server polling system with dynamic service control. Journal of Industrial & Management Optimization, 2018, 14 (2) : 743-757. doi: 10.3934/jimo.2017073 [9] Wai-Ki Ching, Sin-Man Choi, Min Huang. Optimal service capacity in a multiple-server queueing system: A game theory approach. Journal of Industrial & Management Optimization, 2010, 6 (1) : 73-102. doi: 10.3934/jimo.2010.6.73 [10] Willem Mélange, Herwig Bruneel, Bart Steyaert, Dieter Claeys, Joris Walraevens. A continuous-time queueing model with class clustering and global FCFS service discipline. Journal of Industrial & Management Optimization, 2014, 10 (1) : 193-206. doi: 10.3934/jimo.2014.10.193 [11] Volker Rehbock, Iztok Livk. Optimal control of a batch crystallization process. Journal of Industrial & Management Optimization, 2007, 3 (3) : 585-596. doi: 10.3934/jimo.2007.3.585 [12] Yen-Luan Chen, Chin-Chih Chang, Zhe George Zhang, Xiaofeng Chen. Optimal preventive "maintenance-first or -last" policies with generalized imperfect maintenance models. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020149 [13] Rongfei Liu, Dingcheng Wang, Jiangyan Peng. Infinite-time ruin probability of a renewal risk model with exponential Levy process investment and dependent claims and inter-arrival times. Journal of Industrial & Management Optimization, 2017, 13 (2) : 995-1007. doi: 10.3934/jimo.2016058 [14] Yi Peng, Jinbiao Wu. Analysis of a batch arrival retrial queue with impatient customers subject to the server disasters. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020067 [15] Yoshiaki Inoue, Tetsuya Takine. The FIFO single-server queue with disasters and multiple Markovian arrival streams. Journal of Industrial & Management Optimization, 2014, 10 (1) : 57-87. doi: 10.3934/jimo.2014.10.57 [16] Ellina Grigorieva, Evgenii Khailov. A nonlinear controlled system of differential equations describing the process of production and sales of a consumer good. Conference Publications, 2003, 2003 (Special) : 359-364. doi: 10.3934/proc.2003.2003.359 [17] Gábor Horváth, Zsolt Saffer, Miklós Telek. Queue length analysis of a Markov-modulated vacation queue with dependent arrival and service processes and exhaustive service policy. Journal of Industrial & Management Optimization, 2017, 13 (3) : 1365-1381. doi: 10.3934/jimo.2016077 [18] Simone Göttlich, Stephan Knapp. Semi-Markovian capacities in production network models. Discrete & Continuous Dynamical Systems - B, 2017, 22 (9) : 3235-3258. doi: 10.3934/dcdsb.2017090 [19] Masoud Ebrahimi, Seyyed Mohammad Taghi Fatemi Ghomi, Behrooz Karimi. Application of the preventive maintenance scheduling to increase the equipment reliability: Case study- bag filters in cement factory. Journal of Industrial & Management Optimization, 2020, 16 (1) : 189-205. doi: 10.3934/jimo.2018146 [20] Le Thi Hoai An, Tran Duc Quynh, Kondo Hloindo Adjallah. A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors. Journal of Industrial & Management Optimization, 2014, 10 (1) : 243-258. doi: 10.3934/jimo.2014.10.243

2019 Impact Factor: 1.366