The heuristic and metahuristic methods to minimize the total completion and total tardiness jobs times problem

مراجع و منابع این مقاله:

• T.S. Abdul-Razaq and F.H. Ali, Algorithm for scheduling a single ...
• College Sci. ۴۶ (۲۰۲۰) ...
• F.H. Ali, Improving exact and local search algorithms for solving ...
• D. Thesis, Mustansiriyah University, College of Science, Dept. of Mathematics, ...
• S.A. Ali, A comparison of local search algorithm for multicriteria ...
• F.H. Ali and S.B. Abdul-Kareem, Scheduling a single machine to ...
• F.H. Ali and M.G. Ahmed, Local search methods for solving ...
• J. Blazewics, K.H. Ecker, E. Pesch, G. Schmidt and J. ...
• H.A. Chachan, F.H. Ali and M.H. Ibrahim, Branch and bound ...
• H.A. Chachan and A.S. Hameed, Exact methods for solving multi-objective ...
• C. Gallo and V. Capozzi, A simulated annealing algorithm for ...
• J.A. Hoogeveen, Minimizing maximum earliness and maximum lateness on a ...
• J.A. Hoogeveen, Single machine scheduling to minimize a function of ...
• Algorithms ۲۱ (۱۹۹۶), ۴۱۵–۴۳۳ ...
• S.M. Jasim and F.H. Ali, Exact and local search methods ...
• B. Kolman, Introductory linear algebra with applications, Macmillan Publishing Company, ...
• C.R. Reeves, Modern heuristic techniques for combinatorial problems, John Wiley ...
نمایش کامل مراجع