An efficient frontier for sum deviation JIT sequencing problem in mixed-model systems via apportionment

Authors:
Tanka Nath Dhamala;Gyan Bahadur Thapa;Hong-Nian Yu
Affiliations:
Central Department of Mathematics, Institute of Science and Technology, Tribhuvan University, Tribhuvan, Nepal;Department of Mathematics, Pulchowk Campus, Institute of Engineering, Tribhuvan University, Tribhuvan, Nepal;Faculty of Computing, Engineering and Technology, Staffordshire University, Stafford, UK
Venue:
International Journal of Automation and Computing
Year:
2012

Citing 9
Cited 0

Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science
A parallel shortest augmenting path algorithm for the assignment problem

Journal of the ACM (JACM)
Sequencing JIT mixed-model assembly lines

Management Science
Cyclic Just-In-Time Sequences Are Optimal

Journal of Global Optimization
Note: Solving symmetric mixed-model multi-level just-in-time scheduling problems

Discrete Applied Mathematics
Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study

Management Science
Modeling of agile intelligent manufacturing-oriented production scheduling system

International Journal of Automation and Computing
Supply chain network equilibrium with revenue sharing contract under demand disruptions

International Journal of Automation and Computing
A simple approach to the product rate variation problem via axiomatics

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the sum deviation just-in-time (JIT) sequencing problem in mixed-model production systems is studied relating with the discrete apportionment problem together with their respective mathematical formulations. The assignment formulation for the first problem is briefly discussed followed by the existence of JIT cyclic sequences. Presenting the concise discussion on divisor methods for the discrete apportionment problem, we have proposed two mean-based divisor functions for this problem claiming that they are better than the existing divisors; hence, we found a better bound for the JIT sequencing problem. The linkage of both the problems is characterized in terms of similar type of objective functions. The problems are shown equivalent via suitable transformations and similar properties. The joint approaches for the two problems are discussed in terms of global and local deviations proposing equitably efficient solution.