Estimation of the Largest and the Smallest Function Values of a Feasible Solution for the Total Product Rate Variation Problem
Keywords:
Bound, Product rate variation problem, Non-linear integer programming problemAbstract
The problem of minimizing the total deviations between the actual and the ideal cumulative production of a variety of models of a common base product arises as a sequencing problem in mixed-model just-in-time production systems. This is called the total product rate variation problem. Several pseudo-polynomial exact algorithms and heuristics have been derived for this problem. In this paper, we estimate the largest and the smallest function values of a feasible solution for the problem when the m-th power of the total deviations between the actual and the ideal cumulative productions has to be minimized
Journal of Institute of Science and Technology, 2014, 19(1): 35-38
Downloads
Published
How to Cite
Issue
Section
License
The copyright of the articles is held by the Institute of Science and Technology, Tribhuvan University (IoST- TU). The views and interpretations in this journal are those of the author(s). They are not attributable to the IoST-TU and do not imply the expression of any opinion concerning the legal status of any country, territory, city, area of its authorities, or concerning the delimitation of its frontiers or boundaries. The corresponding author is responsible for any conflict of interest between authors and others.
The articles in the Journal of Institute of Science and Technology are licensed under a Creative Commons Attribution- Share Alike 4.0 International License (CC: BY-NC), which permits use, distribution and reproduction in any medium or format, remix, transfer, and build upon the materials for any purpose, even commercially, provided the original work is properly cited.
