Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Hanan Ali Chachan"'
Publikováno v:
Al-Mustansiriyah Journal of Science, Vol 33, Iss 3, Pp 54-59 (2022)
In this study, we propose multi-objective functions which consist of the sum of completion time, tardiness time and earliness time where Ci denoted the completion time of job (i), Ti=max{Ci-di,0}, denotes the tardiness of job (i), Ei=max{di-Ci,0} be
Externí odkaz:
https://doaj.org/article/3a56b70bb4284accb523b7dd7e35dd3e
Publikováno v:
Ibn Al-Haitham Journal for Pure and Applied Sciences, Vol 33, Iss 3 (2020)
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.
Externí odkaz:
https://doaj.org/article/d5d5925746ab4b5b97fdfddfcafa2041
Autor:
Alaa Sabah Hameed, Hanan Ali Chachan
Publikováno v:
Ibn Al-Haitham Journal for Pure and Applied Sciences, Vol 33, Iss 1 (2020)
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
Externí odkaz:
https://doaj.org/article/57aa8b7d432d4610b7b176035a98ee16
Publikováno v:
INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15bdaa0598055b729a81734768ec6220
https://doi.org/10.1063/5.0117217
https://doi.org/10.1063/5.0117217
Autor:
Hanan Ali Chachan, Faez Hassan Ali
Publikováno v:
Iraqi Journal of Science. :275-288
A hybrid particulate swarm optimization (hybrid) combination of an optimization algorithm of the particle swarm and a variable neighborhood search algorithm is proposed for the multi-objective permutation flow shop scheduling problem (PFSP) with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2fd75264c4a52fa38ad77bc0d5186ab
https://doi.org/10.24996/ijs.2021.62.1.26
https://doi.org/10.24996/ijs.2021.62.1.26
Autor:
Hanan Ali Chachan, Alaa Sabah Hameed
Publikováno v:
Iraqi Journal of Science. :1802-1813
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a7831483f7bc4ac0fabaab7be6c9301
https://doi.org/10.24996/ijs.2019.60.8.17
https://doi.org/10.24996/ijs.2019.60.8.17
Publikováno v:
2020 6th International Engineering Conference “Sustainable Technology and Development" (IEC).
In this paper, we suggest a multi-objective Machine Scheduling Problem (MSP). The discussed problem is the sum of total completion time, total tardiness, total earliness time, total late work and total number of late jobs. This work includes the theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20562078c47d0a064c8bd4d2273e7a70
https://doi.org/10.1109/iec49899.2020.9122793
https://doi.org/10.1109/iec49899.2020.9122793
Publikováno v:
Journal of Physics: Conference Series. 1879:032023
In this paper, neural networks (NN) are implemented to manipulate a problem of machine scheduling for a single machine to minimize multicriteria objective function: maximum tardiness, maximum late work and total late work simultaneously (Tmax, Vmax,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5b8f9a1f1e7f08087227676836f115f
https://doi.org/10.1088/1742-6596/1879/3/032023
https://doi.org/10.1088/1742-6596/1879/3/032023
Autor:
Hanan Ali Chachan, Alaa Sabah Hameed
Publikováno v:
Ibn AL- Haitham Journal For Pure and Applied Sciences. 33:119
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d7a30a366fce4765567d8509449fb46
https://doi.org/10.30526/33.1.2378
https://doi.org/10.30526/33.1.2378