Abstract
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
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
