Apportionment Approach for Just-In-Time Sequencing Problem

Authors

  • Tanka Nath Dhamala Institute of Science and Technology
  • Gyan Bahadur Thapa Institute of Engineering

DOI:

https://doi.org/10.3126/jie.v7i1.2065

Keywords:

Apportionment, Divisor methods, Algorithms, Just-in-Time sequencing.

Abstract

The Just-in-Time sequencing of different products is a well-known socio-industrial problem which is supposed to minimize the maximum and total deviations between actual and ideal productions; and the apportionment problem is a socio-political problem which aims to allocate representatives to a state as close as its exact quota. Significant amounts of research have been done in these two problems independently. The relation between them has been studied from last decade. In this article, both problems are addressed with some just-in-time sequencing algorithms and their characterizations via apportionment.

Key words: apportionment, divisor methods, algorithms, Just-in-Time sequencing.

Journal of the Institute of Engineering, Vol. 7, No. 1, July, 2009 pp.76-89

doi: 10.3126/jie.v7i1.2065

Downloads

Download data is not yet available.
Abstract
689
PDF
861

Author Biographies

Tanka Nath Dhamala, Institute of Science and Technology

Prof., Central Department of Mathematics, Institute of Science and Technology, Tribhuvan University Presently: Central Department of Computer Science and Information Technology, TU, Kirtipur.

Gyan Bahadur Thapa, Institute of Engineering

Lecturer, Department of Mathematics, Pulchowk Campus, Institute of Engineering, Tribhuvan University

Downloads

How to Cite

Dhamala, T. N., & Thapa, G. B. (2009). Apportionment Approach for Just-In-Time Sequencing Problem. Journal of the Institute of Engineering, 7(1), 76–89. https://doi.org/10.3126/jie.v7i1.2065

Issue

Vol. 7 No. 1 (2009)

Section

Articles

License

The Copyright is held by Journal of the Institute of Engineering, IOE, TU