Preferred Language
Articles
/
jih-2479
Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine
...Show More Authors

     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restricting the search.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Aug 26 2019
Journal Name
Iraqi Journal Of Science
Exact Methods for Solving Multi-Objective Problem on Single Machine Scheduling
...Show More Authors

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

... Show More
View Publication Preview PDF
Scopus (10)
Crossref (7)
Scopus Crossref
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 Crossref
Publication Date
Mon Jun 10 2024
Journal Name
Iraqi Journal For Computer Science And Mathematics
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

... Show More
View Publication
Scopus Crossref
Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem
...Show More Authors

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Mon Jan 20 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Genetic Algorithm and Particle Swarm Optimization Techniques for Solving Multi-Objectives on Single Machine Scheduling Problem
...Show More Authors

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

View Publication Preview PDF
Crossref
Publication Date
Sun Jul 30 2023
Journal Name
Iraqi Journal Of Science
Exact and Near Pareto Optimal Solutions for Total Completion Time and Total Late Work Problem
...Show More Authors

     In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times  simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.

View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Fri Aug 28 2020
Journal Name
Iraqi Journal Of Science
Using Heuristic and Branch and Bound Methods to Solve a Multi-Criteria Machine Scheduling Problem
...Show More Authors

In this paper, we investigate some methods to solve one of the multi-criteria machine scheduling problems. The discussed problem is the total completion time and the total earliness jobs  To solve this problem, some heuristic methods are proposed which provided good results. The Branch and Bound (BAB) method is applied with new suggested upper and lower bounds to solve the discussed problem, which produced exact results for  in a reasonable time.

View Publication Preview PDF
Scopus (10)
Crossref (3)
Scopus Crossref
Publication Date
Sun Jan 25 2015
Journal Name
International Journal Of Applied Mathematical Research
Exact solutions to linear and nonlinear wave and diffusion equations
...Show More Authors

View Publication
Crossref (3)
Crossref
Publication Date
Mon May 11 2020
Journal Name
Baghdad Science Journal
Oscillation Criteria for Solutions of Neutral Differential Equations of Impulses Effect with Positive and Negative Coefficients: eventually positive solutions and differential inequalities
...Show More Authors

In this paper, some necessary and sufficient conditions are obtained to ensure the oscillatory of all solutions of the first order impulsive neutral differential equations. Also, some results in the references have been improved and generalized. New lemmas are established to demonstrate the oscillation property. Special impulsive conditions associated with neutral differential equation are submitted. Some examples are given to illustrate the obtained results.

View Publication Preview PDF
Scopus (5)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sun May 26 2019
Journal Name
Iraqi Journal Of Science
Exact and Local Search Methods for Solving Travelling Salesman Problem with Practical Application
...Show More Authors

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Crossref