Modelling and solving the production rate variation problem (PRVP)

Top ◽  
1997 ◽  
Vol 5 (2) ◽  
pp. 221-239 ◽  
Author(s):  
Joaquín Bautista ◽  
Ramon Companys ◽  
Albert Corominas
BIBECHANA ◽  
2012 ◽  
Vol 8 ◽  
pp. 53-58
Author(s):  
Shree Ram Khadka

The product rate variation problem with batching minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of significant setup and arbitrary processing times for each copy of each model. Establishment of bottlenecks to the problem is important for the feasible and the optimal solution to the problem. In this paper, the lower and the upper bottlenecks to the problem are established. Moreover, small bottlenecks that lead to optimality to some instances are investigated.Keywords: Product rate variation problem; batching; sequencing problem; nonlinear integer programmingDOI: http://dx.doi.org/10.3126/bibechana.v8i0.4876BIBECHANA 8 (2012) 53-58


2020 ◽  
Vol 28 (1) ◽  
pp. 72-84 ◽  
Author(s):  
Sofiene Dellagi ◽  
Wajdi Trabelsi ◽  
Zied Hajej ◽  
Nidhal Rezg

This study develops an analytical model in order to determine an optimal integrated maintenance plan and spare parts management. We consider a manufacturing system, producing only one type of product, over a finite planning horizon H equal to the sum of all production periods and the production quantity of each period is known. This system is subject to a continuously increasing degradation rate. That is why a preventive maintenance strategy is adopted in order to face the increasing failure rate. We noted that contrarily to the majority of studies in literature, we take into account the impact of the production rate variation on the manufacturing system degradation and consequently on the adopted optimal maintenance strategy. In addition, the real need of spare parts relative to the scheduled maintenance actions is taken into account. In fact, the purpose of our study consists at determining the optimal preventive maintenance frequency and the optimal quantity of spare parts to order by minimizing a total cost, including maintenance and spare parts management. Numerical examples are presented along with a sensitivity study in order to prove the use of the developed model for deriving the optimal integrated strategy for any instance of the problem.


2000 ◽  
Vol 124 (3) ◽  
pp. 468-477 ◽  
Author(s):  
Joaquı́n Bautista ◽  
Ramon Companys ◽  
Albert Corominas

2021 ◽  
Vol 237 ◽  
pp. 106678
Author(s):  
Partha Sarathi Jena ◽  
Ravi Bhushan ◽  
Ajay Shivam ◽  
Romi Nambiar ◽  
Nisha Bharti

2020 ◽  
Vol 37 (1-2) ◽  
pp. 47-54
Author(s):  
Shree Ram Khadka

The sequencing problem which minimizes the deviation between the actual (integral) and the ideal (rational) cumulative production of a variety of models of a common base product is called the product rate variation problem. If the objective is to minimize the maximum deviation, the problem is bottleneck product rate variation problem and the problem with the objective of minimizing all the deviations is the total product rate variation problem. The problem has been widely studied with several pseudo-polynomial time exact algorithms and heurism-tics. The lower bound of a feasible solution to the problem has been investigated to be tight. However, the upper bound of a feasible solution had been established in the literature which could further be improved. In this paper, we propose the improved upper bound for BPRVP and TPRVP.


Author(s):  
TN Dhamala

We consider the problem of obtaining an optimal mixed-model sequence under the just-in-time environment. Industrial applications include the production planning, real-time scheduling, response time variability and networking. The single-level problems are already solved, but they are strongly NP-hard in the multi-levels. Here, we study a bottleneck product rate variation problem with a general objective where a given set of sequences serves as chain constraints. We extend the previous result of a similar problem with min-max deviation objective in single- level. We present a pseudo-polynomial algorithm that obtains an optimal solution for the considered objective. The results are valid for precedence constraints. Keywords: integer programming; just-in-time sequencing; mixed-model systems; bottleneck product rate variation; precedence constraints. DOI: http://dx.doi.org/ 10.3126/kuset.v7i1.5423 KUSET 2011; 7(1): 63-73


Proceedings ◽  
2019 ◽  
Vol 26 (1) ◽  
pp. 51
Author(s):  
Germogli ◽  
Salvador ◽  
Bacci ◽  
Bagli ◽  
Bandiera ◽  
...  

The production techniques of radioisotopes for medical purposes is a valuable and important field in nuclear medicine. In particular, the expensive cost of the prime materials for the production via cyclotron obliges the search for new solutions to enhance the production rate with minor upgrades of the current instrumentation. Oriented ordered structure can modify particle trajectories inside a medium leading to a sensible variation of the interaction rate with atomic nuclei. Under specific orientations of the target with respect to the incident beam, the probability of inelastic interaction with nuclei can be enhanced with respect to the standard rate. This effect is called anti-channeling and leads to an increase of the radioisotope production yield. A dedicated set of experimental measurements were carried out at the CN accelerator of the INFN Legnaro Laboratories to investigate nuclear reactions under channeling experiments. In particular, the production of the Arsenic-74 radioisotope through a proton beam delivered to a natural single-crystal Germanium target was monitored via γ-spectroscopy of the prompt γ-rays upon de-excitation of produced nuclei, in order to quantify the production rate variation as a function of the incident angle.


Sign in / Sign up

Export Citation Format

Share Document