Preferred Language
Articles
/
xhedJZIBVTCNdQwCEJ6q
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem
...Show More Authors

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two exact methods are important; a Branch and Bound algorithm (BAB) and a complete enumeration (CEM) method are applied to solve the three proposed MSP criteria by finding a set of efficient solutions. The experimental results showed that CEM can solve problems for up to  jobs. Two approaches of the BAB method were applied: the first approach was BAB without dominance rule (DR), and the BAB method used dominance rules to reduce the number of sequences that need to be considered. Also, this method can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to  jobs in a reasonable time to find efficient solutions to this problem. In addition, to find good approximate solutions, two heuristic methods for solving the problem are proposed, the first heuristic method can solve up to  jobs, while the second heuristic method can solve up to  jobs. Practical experiments prove the good performance regarding the two suggested approaches for the original problem. While for a sub-problem the experimental results showed that CEM can solve problems for up to  jobs, the BAB without dominance rule (DR) can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to  jobs in a reasonable time to find efficient solutions to this problem. Finally, the heuristic method can solve up to jobs. Arithmetic results are calculated by coding (programming) algorithms using (MATLAB 2019a)  

Scopus Crossref
View Publication
Publication Date
Fri Apr 26 2024
Journal Name
Mathematical Modelling Of Engineering Problems
Solving Tri-criteria: Total Completion Time, Total Earliness, and Maximum Tardiness Using Exact and Heuristic Methods on Single-Machine Scheduling Problems
...Show More Authors

View Publication
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Mon May 01 2023
Journal Name
Periodicals Of Engineering And Natural Sciences
Solving the multi-criteria: total completion time, total late work, and maximum earliness problem
...Show More Authors

Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic

... Show More
View Publication
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of The College Of Basic Education
Solving Job-Shop Scheduling Problem Using Genetic Algorithm Approach
...Show More Authors

Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
View Publication Preview PDF
Scopus (15)
Crossref (7)
Scopus Clarivate Crossref
Publication Date
Sun Jul 09 2023
Journal Name
Journal Of Engineering
Solving Time-Cost Tradeoff Problem with Resource Constraint Using Fuzzy Mathematical Model
...Show More Authors

Scheduling considered being one of the most fundamental and essential bases of the project management. Several methods are used for project scheduling such as CPM, PERT and GERT. Since too many uncertainties are involved in methods for estimating the duration and cost of activities, these methods lack the capability of modeling practical projects. Although schedules can be developed for construction projects at early stage, there is always a possibility for unexpected material or technical shortages during construction stage. The objective of this research is to build a fuzzy mathematical model including time cost tradeoff and resource constraints analysis to be applied concurrently. The proposed model has been formulated using fuzzy the

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Thu Mar 01 2018
Journal Name
Case Studies In Thermal Engineering
The temperatures distributions of a single-disc clutches using heat partitioning and total heat generated approaches
...Show More Authors

View Publication
Scopus (36)
Crossref (33)
Scopus Clarivate Crossref
Publication Date
Tue Jun 30 2020
Journal Name
Journal Of Economics And Administrative Sciences
Using The Maximum Likelihood And Bayesian Methods To Estimate The Time-Rate Function Of Earthquake Phenomenon
...Show More Authors

In this research, we dealt with the study of the Non-Homogeneous Poisson process, which is one of the most important statistical issues that have a role in scientific development as it is related to accidents that occur in reality, which are modeled according to Poisson’s operations, because the occurrence of this accident is related to time, whether with the change of time or its stability. In our research, this clarifies the Non-Homogeneous hemispheric process and the use of one of these models of processes, which is an exponentiated - Weibull model that contains three parameters (α, β, σ) as a function to estimate the time rate of occurrence of earthquakes in Erbil Governorate, as the governorate is adjacent to two countr

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Jun 01 2016
Journal Name
Nternational Journal Of Mathematics Trends And Technology (ijmtt)
Fuzzy Scheduling Problem on Two Machines
...Show More Authors

Publication Date
Wed Dec 23 2020
Journal Name
Iraqi Journal For Electrical And Electronic Engineering
Heuristic and Meta-Heuristic Optimization Models for Task Scheduling in Cloud-Fog Systems: A Review
...Show More Authors

Nowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th

... Show More
View Publication
Crossref (11)
Crossref
Publication Date
Mon Jan 20 2020
Journal Name
Kuwait Journal Of Science
Three iterative methods for solving Jeffery-Hamel flow problem
...Show More Authors

In this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.

... Show More
View Publication Preview PDF