Devising an efficient approach to determine the optimal sequence of from-to matrix

Authors

DOI:

https://doi.org/10.15587/1729-4061.2021.237944

Keywords:

optimal sequence, binary linear programming, From-To matrix, exact solution

Abstract

Sequencing is the most impact factor in many production areas, such as assembly lines, batch production, Travelling Salesman Problem (TSP), product sequences, process sequences, etc. The flow and analysis from one item to another can be presented by the square matrix in which the number of rows or columns is equal to the number of manipulated items, this special matrix form is called “From-To matrix”. The matrix suffers from many drawbacks when it is applied to determine the optimal sequences, such as the number of variables must be as small as possible, there is no flexibility to determine the start or the end sequence to find the best sequencing with some conditions. Also, there is no possibility to add relations to point a variable as wanted or prevented from the sequence. In this paper, we solve the From-To matrix by binary linear programming (BLP).

The proposed BLP approach has been applied in Ur company to solve the From-To matrix. This company has a production line that can manufacture four products: A, B, C, and D, the setup time matrix is considered as From-To matrix and the goal of this company is to get an optimum sequence of products with minimum time. The solution of state transition of the From-To matrix using BLP can be formulated in the following five model cases according to transition requirement condition and desired: the first case gives all possible sequence items, the second case lists the sequence items when the first sequence is known, the third case lists the sequence items when the last sequence is known, the fourth case gives all possible sequence items with a condition that prevents occurring of an undesired sequence, and the fifth case gives all possible sequence items with the condition of a wanted occurring of the desired sequence.

Furthermore, we found the optimum sequences for states by determining the start or end sequences, and also add the wanted relations or prevented. The mathematical formulas for the number of all sequences under some conditions are derived and proved

Author Biographies

Watheq Laith, University of Sumer

Industrial engineering, Professor

Department of Businesses Administration

Rasheed Al-Salih, Missouri University of Science and Technology; University of Sumer

PhD, Professor

Department of Mathematics and Statistics

Department of Statistics

References

  1. Belabid, J., Aqil, S., Allali, K. (2020). Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time. Journal of Applied Mathematics, 2020, 1–11. doi: http://doi.org/10.1155/2020/7132469
  2. Laith, W. H., Abed Ali, S. S., Mahmoud, A. M. (2015). Determine the optimal sequence – dependent setup cost and / or setup time for single demand with multiple products using modified assignment method. Industrial Engineering Letters, 5 (8). Available at: https://www.iiste.org/Journals/index.php/IEL/article/view/24747/25350
  3. Ince, Y., Karabulut, K., Tasgetiren, M. F., Pan, Q.-K. (2016). A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times. Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC). Vancouver, 3401–3408. doi: http://doi.org/10.1109/cec.2016.7744220
  4. Jingxu, H. (2008). Heuristic procedures to solve sequencing and scheduling problems in automobile industry. Knoxville. Available at: https://trace.tennessee.edu/utk_graddiss/385/
  5. Clark, A. R., Morabito, R., Toso, E. A. V. (2009). Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching. Journal of Scheduling, 13 (2), 111–121. doi: http://doi.org/10.1007/s10951-009-0135-7
  6. Salmasi, N., Logendran, R., Skandari, M. R. (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. The International Journal of Advanced Manufacturing Technology, 56 (5-8), 699–710. doi: http://doi.org/10.1007/s00170-011-3206-9
  7. Costa, A., Fichera, S., Cappadonna, F. (2013). A Genetic algorithm for scheduling both job families and skilled workforce. International Journal of Operations and Quantitative Management, 19.
  8. Patricia, C. (2014). Shop scheduling in the presence of batching, sequence-dependent setups and incompatible job families minimizing farliness and tardiness penalties. Florida. Available at: https://www.semanticscholar.org/paper/Shop-Scheduling-In-The-Presence-Of-Batching%2C-Setups-Buchanan/bb50143b0526fe79e23364ca7e71d872ace6e981
  9. Laith, W. H., Abed Ali, S. S., Mahmoud, A. M. (2015). Determine the optimal sequence-dependent completion times for multiple demand with multi-products using genetic algorithm. Journal of Information Engineering and Applications, 5 (8).
  10. Lin, V. (2017). Binary integer programming solution for troubleshooting with dependent actions. Kybertika, 53 (3), 493–512. doi: http://doi.org/10.14736/kyb-2017-3-0493
  11. Pessanha, J. F. M., Santos, N. M. G. dos. (2019). Organizing business forums with integer linear programming. Pesquisa Operacional, 39 (3), 379–392. doi: http://doi.org/10.1590/0101-7438.2019.039.03.0379

Downloads

Published

2021-08-31

How to Cite

Laith, W., & Al-Salih, R. (2021). Devising an efficient approach to determine the optimal sequence of from-to matrix . Eastern-European Journal of Enterprise Technologies, 4(3(112), 6–12. https://doi.org/10.15587/1729-4061.2021.237944

Issue

Vol. 4 No. 3(112) (2021): Control processes

Section

Control processes

License

Copyright (c) 2021 Watheq Laith, Rasheed Al-Salih

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.