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

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 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

Integrated Approach for Flexible Mixed Model Assembly Lines Balancing and Model Sequencing Problem

2014 ◽  
Vol 670-671 ◽  
pp. 1593-1600 ◽  
Author(s):  
Li Nie ◽  
Yue Wei Bai ◽  
Jun Wu ◽  
Chang Tao Pang
Keyword(s):  
Mixed Model ◽  
Optimal Solution ◽  
Integrated Approach ◽  
Mixed Integer ◽  
Assembly Lines ◽  
Sequencing Problem ◽  
Mixed Model Assembly Lines ◽  
Assembly Tasks ◽  
Mixed Model Assembly Line ◽  
Mixed Model Assembly

The manufacturers nowadays are forced to respond very quickly to changes in the market conditions. To adopt flexible mixed model assembly lines (MMAL) is a preferred way for manufacturers to improve competitiveness. Managing a mixed model assembly line involves two problems: assigning assembly tasks to stations (balancing problem) and determining the sequence of products at each station (sequencing problem). In order to solve both balancing and sequencing problem in MMAL simultaneously, an integrated mathematical model based on mixed integer programming (MIP) is developed to describe the problem. In the model, general type precedence relations and task duplications are considered. Due to the NP-hardness of the balancing and sequencing problem of MMAL, GA is designed to search the optimal solution. The efficiency of the GA is demonstrated by a case study.

A Modified Genetic Algorithm for Sequencing Problem in Mixed Model Assembly Lines

2013 ◽  
Vol 655-657 ◽  
pp. 1675-1681
Author(s):  
Shu Xu ◽  
Fu Ming Li
Keyword(s):  
Genetic Algorithm ◽  
Mixed Model ◽  
Assembly Lines ◽  
Sequencing Problem ◽  
Mixed Model Assembly Lines ◽  
Modified Genetic Algorithm ◽  
Good Ability ◽  
Sequencing Problems ◽  
Dependent Setup Times ◽  
Mixed Model Assembly

On the base of summarizing and contrasting the objectives of sequencing problem in mixed model assembly lines (MMAL) , and in consideration of the influence sequence-dependent setup times , a objective is proposed to minimize the total unfinished works and idle times over all jobs and stations . And the corresponding model is presented. To solve this model, a modified genetic algorithm is proposed to determine suitable sequences. Comparing with the Lingo 9 software, the proposed GA turns out to have a good ability to solve the sequencing problems.

Balancing of simple assembly lines under variations of task processing times

2012 ◽  
Vol 201 (1) ◽  
pp. 265-286 ◽  
Author(s):  
Evgeny Gurevsky ◽  
Olga Battaïa ◽  
Alexandre Dolgui
Keyword(s):  
Assembly Lines ◽  
Processing Times ◽  
Task Processing ◽  
Simple Assembly
Sign in / Sign up

Export Citation Format

Share Document