Bottlenecks to product rate variation problem with batching

Authors

  • Shree Ram Khadka Central Department Mathematics,Tribhuvan University, Kathmandu

DOI:

https://doi.org/10.3126/bibechana.v8i0.4876

Keywords:

Product rate variation problem, batching, sequencing problem, nonlinear integer programming

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 programming

DOI: http://dx.doi.org/10.3126/bibechana.v8i0.4876

BIBECHANA 8 (2012) 53-58

Downloads

Download data is not yet available.
Abstract
762
PDF
1334

Downloads

Published

2012-01-15

How to Cite

Khadka, S. R. (2012). Bottlenecks to product rate variation problem with batching. BIBECHANA, 8, 53–58. https://doi.org/10.3126/bibechana.v8i0.4876

Issue

Vol. 8 (2012)

Section

Research Articles

License

This license enables reusers to distribute, remix, adapt, and build upon the material in any medium or format for noncommercial purposes only, and only so long as attribution is given to the creator.