On Upper Bound for the Bottleneck Product Rate Variation Problem

2016 ◽  
pp. 391-399
Author(s):  
Shree Ram Khadka ◽  
Till Becker
Keyword(s):  
Upper Bound ◽  
Rate Variation ◽  
Variation Problem

scholarly journals Improved Upper Bound to Product Rate Variation Problem

2020 ◽  
Vol 37 (1-2) ◽  
pp. 47-54
Author(s):  
Shree Ram Khadka
Keyword(s):  
Upper Bound ◽  
Feasible Solution ◽  
Exact Algorithms ◽  
Maximum Deviation ◽  
Rate Variation ◽  
Sequencing Problem ◽  
Variation Problem ◽  
Total Product ◽  
Cumulative Production ◽  
The Ideal

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.

scholarly journals Bottlenecks to product rate variation problem with batching

BIBECHANA ◽  
2012 ◽  
Vol 8 ◽  
pp. 53-58
Author(s):  
Shree Ram Khadka
Keyword(s):  
Optimal Solution ◽  
Rate Variation ◽  
Assembly Lines ◽  
Sequencing Problem ◽  
Variation Problem ◽  
Processing Times ◽  
Common Base

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

Note on cyclic sequences in the product rate variation problem

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

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
Keyword(s):  
Production Rate ◽  
Rate Variation ◽  
Variation Problem

scholarly journals AN efficient algorithm for the bottleneck product rate variation problem with precedence constraints

1970 ◽  
Vol 7 (1) ◽  
pp. 63-73
Author(s):  
TN Dhamala
Keyword(s):  
Mixed Model ◽  
Optimal Solution ◽  
Industrial Applications ◽  
Precedence Constraints ◽  
Model Systems ◽  
Time Variability ◽  
Just In Time ◽  
Rate Variation ◽  
Variation Problem ◽  
Single Level

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

A simple approach to the product rate variation problem via axiomatics

1998 ◽  
Vol 22 (4-5) ◽  
pp. 129-135 ◽  
Author(s):  
Michel Balinski ◽  
Niousha Shahidi
Keyword(s):  
Simple Approach ◽  
Rate Variation ◽  
Variation Problem
Sign in / Sign up

Export Citation Format

Share Document