Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Tariq S. Abdul-Razaq"'
Autor:
Tariq S. Abdul-Razaq, Abeer O. Akram
Publikováno v:
Ibn Al-Haitham Journal for Pure and Applied Sciences, Vol 2017, Iss IHSCICONF (2018)
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 cri
Externí odkaz:
https://doaj.org/article/315587be79a14f818ea0c292557e3192
Autor:
Tariq S. Abdul-Razaq, Zainab M. Ali
Publikováno v:
Ibn Al-Haitham Journal for Pure and Applied Sciences, Vol 28, Iss 2 (2017)
In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the
Externí odkaz:
https://doaj.org/article/982f61ac0dfa4e59957972f01a8f9e60
Autor:
Tariq S. Abdul-Razaq, Faez Hassan Ali
Publikováno v:
Journal of Zankoy Sulaimani - Part A. 17:71-90
Autor:
Tariq S. Abdul-Razaq, Faez Hassan Ali
Publikováno v:
IOSR Journal of Mathematics. 10:25-37
This paper presents an approach to schedule n jobs with processing times and due dates on a single machine based on Artificial Neural Network. The purpose of this paper to find a schedule that minimize a function of the sum of completion time and sum
Autor:
Tariq S. Abdul-Razaq, Chris N. Potts
Publikováno v:
Journal of the Operational Research Society. 39:141-152
The problem of sequencing jobs on a single machine to minimize total cost is considered. Machine capacity constraints require that, at any time, at most one job is processed. Also, no machine idle-time between processing jobs is allowed. In contrast
Publikováno v:
Discrete Applied Mathematics. (2-3):235-253
This paper surveys algorithms for the problem of scheduling jobs on a single machine to minimize total weighted tardiness. Special attention is given to two dynamic programming and four branch and bound algorithms. The dynamic programming algorithms