| Issue |
BIO Web Conf.
Volume 97, 2024
Fifth International Scientific Conference of Alkafeel University (ISCKU 2024)
|
|
|---|---|---|
| Article Number | 00146 | |
| Number of page(s) | 6 | |
| DOI | https://doi.org/10.1051/bioconf/20249700146 | |
| Published online | 05 April 2024 | |
Some theorems of minimizing makespan and range of lateness of flow shop machines
1 Department of Computer Science, College of Education, University of Kufa, Najaf, Iraq
2 Department of Mathematics, College of Education for Pure Sciences, University of Kerbala, Karbala, Iraq
3 Department of Mathematics, College of Education for Pure Sciences, University of Babylon, Hilla, Iraq
* Corresponding Author: adilh.alhajjar@uokufa.edu.iq
One of the most challenging and widely debated issues in scheduling theory is the topic of multi-objective job scheduling. The multiobjective function problem including the makespan and the range of lateness of three machines in a flow shop was explored in this study in order to solve it. Some of the theories discussed in this work have to do with the computation of the precise best time and range of lateness. Two types of the three machines have been created, and the theories for each type have been studied. These theories seek to cut down on the amount of time it takes to complete tasks and the range of lateness.
© The Authors, published by EDP Sciences, 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.