Estimation of the Largest and the Smallest Function Values of a Feasible Solution for the Total Product Rate Variation Problem

Authors

  • Shree Ram Khadka Central Department Mathematics, Institute of Science and Tchnology, Tribhuvan University, Kathmandu

DOI:

https://doi.org/10.3126/jist.v19i1.13824

Keywords:

Bound, Product rate variation problem, Non-linear integer programming problem

Abstract

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

Download data is not yet available.
Abstract
880
PDF
578

Downloads

Published

2015-11-08

How to Cite

Khadka, S. R. (2015). Estimation of the Largest and the Smallest Function Values of a Feasible Solution for the Total Product Rate Variation Problem. Journal of Institute of Science and Technology, 19(1), 35–38. https://doi.org/10.3126/jist.v19i1.13824

Issue

Vol. 19 No. 1 (2014)

Section

Research Articles

License

The views and interpretations in this journal are those of the author(s). They are not attributable to the Institute of Science and Technology, T.U. 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 of boundaries.

The copyright of the articles is held by the Institute of Science and Technology, T.U.