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

This source preferred by Hongnian Yu

This data was imported from Scopus:

Authors: Dhamala, T.N., Thapa, G.B. and Yu, H.N.

Journal: International Journal of Automation and Computing

Volume: 9

Issue: 1

Pages: 87-97

eISSN: 1751-8520

ISSN: 1476-8186

DOI: 10.1007/s11633-012-0620-x

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. © 2012 Institute of Automation, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg.

The data on this page was last updated at 04:55 on May 22, 2019.