Abstract
Sequencing units on a production or assembly line in order to attenuate the variations in the rates of resource consumption is a problem that has received growing attention in recent years. In the present study, a particular case, the product rate variation (PRV) problem with convex discrepancy function, is analysed. Its equivalence to the determination of a minimal path on a graph is shown. In addition, a useful property when the number of units for each kind of product to be sequenced is divisible by k (with k as an positive integer) is established. In this case an optimum sequence is obtained by repeating k times an optimum sequence in the reduced problem, once the units of each product have been divided by k.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
