Zobrazeno 1 - 10
of 2 311
pro vyhledávání: '"SCHEDULING PROBLEMS"'
Autor:
Shuangji Yao, Yunfei Guo, Botao Yang, You Lv, Marco Ceccarelli, Xiaoshuang Dai, Giuseppe Carbone
Publikováno v:
STEM Education, Vol 4, Iss 3, Pp 299-327 (2024)
Given the characteristics of the flexible job-shop scheduling problem and the practical production of a given enterprise, a flexible job-shop scheduling model was proposed to minimize the maximum completion time. A novel algorithm was proposed to sol
Externí odkaz:
https://doaj.org/article/1144488ac00943769a107d635902fa75
Publikováno v:
In Engineering Applications of Artificial Intelligence 15 February 2025 142
Publikováno v:
Mathematical Biosciences and Engineering, Vol 21, Iss 1, Pp 1445-1471 (2024)
With the rise of Industry 4.0, manufacturing is shifting towards customization and flexibility, presenting new challenges to meet rapidly evolving market and customer needs. To address these challenges, this paper suggests a novel approach to address
Externí odkaz:
https://doaj.org/article/8d3cb687e0d1448e90447d16070ba218
Publikováno v:
Al-Mustansiriyah Journal of Science, Vol 34, Iss 4 (2023)
In this paper, we have improved solutions for two of the Multi-Criteria Machine Scheduling Problems (MCMSP). These problems are to maximize early jobs time and range of lateness jobs times (1//(E_max,R_L ), and the second problem is maximum tardy job
Externí odkaz:
https://doaj.org/article/2a13f75732674021b644d9d9446cbec0
Publikováno v:
Tehnički Vjesnik, Vol 30, Iss 4, Pp 1257-1264 (2023)
Since production scheduling is considered a short-term plan for future production planning, the advantages of effective scheduling and control and their contribution to the production process are numerous. Efficient use of resources improves producti
Externí odkaz:
https://doaj.org/article/82490a2efb384f1d8d860d2a24b601bb
Autor:
Hawzhin Salh, Ayad Ramadan
Publikováno v:
المجلة العراقية للعلوم الاحصائية, Vol 19, Iss 2, Pp 55-63 (2022)
In this research paper, n jobs have to be scheduled on one-machine to minimize the sum of maximum earliness and maximum tardiness. We solved a series of bi-criteria scheduling problems that related to minimize the sum of the maximum earliness and tar
Externí odkaz:
https://doaj.org/article/ede7ec5300884cefb066a81d66f17663
Publikováno v:
Al-Mustansiriyah Journal of Science, Vol 33, Iss 3, Pp 27-35 (2022)
In this paper, we proposed new techniques to solve one of the important fields of the Combinatorial Optimization Problem, which is the problem of machine scheduling. The problem which wants to be solved in this paper is the total tardiness times and
Externí odkaz:
https://doaj.org/article/e4534d78289c4abe8a2829928508ffca
Publikováno v:
Iraqi Journal for Computer Science and Mathematics, Vol 4, Iss 2 (2023)
This study deals with an unrelated parallel machine scheduling problem with additional resources (UPMR). That is one of the important sub-problems in the scheduling. UPMR consists of scheduling a set of jobs on unrelated machines. In addition to that
Externí odkaz:
https://doaj.org/article/7ecbb98c08884a5eb02675ecfc1ce420
Autor:
Başar Mehmet Sinan, Kul Sinan
Publikováno v:
Open Computer Science, Vol 12, Iss 1, Pp 181-190 (2022)
In this study, a student-based placement model using the A* algorithm is proposed and applied to solve the problem of placing the courses in exam sessions. The application area of the model is midterm and final exams, conducted by the Open Education
Externí odkaz:
https://doaj.org/article/994af2798d5944feacc23faa7bec877c
Publikováno v:
IEEE Access, Vol 10, Pp 52126-52138 (2022)
The Tardy/Lost (TL) penalties scheduling is a discrete optimization problem. TL scheduling problem is an NP-hard problem. As a result, proposing an optimization algorithm to handle this problem is critical. In a TL problem, a given set of jobs is sch
Externí odkaz:
https://doaj.org/article/2196c6eb36194e89b3e9437ffedd3477