Bahman Naderi mostly deals with Mathematical optimization, Job shop scheduling, Simulated annealing, Metaheuristic and Flow shop scheduling. His Mathematical optimization research is multidisciplinary, incorporating elements of Taguchi methods, Sequence-dependent setup and Completion time. He has researched Job shop scheduling in several fields, including Integer programming and Minification.
His Simulated annealing study frequently draws connections to other fields, such as Tardiness. His research in Flow shop scheduling intersects with topics in Algorithm and Heuristics. His Scheduling study incorporates themes from Effective algorithm and Iterated greedy.
Bahman Naderi mainly investigates Mathematical optimization, Job shop scheduling, Metaheuristic, Flow shop scheduling and Scheduling. As a member of one scientific family, Bahman Naderi mostly works in the field of Mathematical optimization, focusing on Tardiness and, on occasion, Linear programming. His studies deal with areas such as Decision variables, Preventive maintenance, Tabu search, Minification and Heuristics as well as Job shop scheduling.
In his study, Open-shop scheduling is inextricably linked to Open shop, which falls within the broad field of Metaheuristic. The study incorporates disciplines such as Iterated local search, Algorithm and Rate-monotonic scheduling in addition to Flow shop scheduling. He combines subjects such as Parallel computing, Real-time computing and Fair-share scheduling with his study of Scheduling.
Bahman Naderi spends much of his time researching Mathematical optimization, Benders' decomposition, Algorithm, Scheduling and Operations research. His study in the field of Integer programming, Combinatorial optimization and Relaxation also crosses realms of Schedule and Circular economy. The various areas that Bahman Naderi examines in his Benders' decomposition study include Theory of computation and Job shop scheduling.
His study in the fields of Machine scheduling under the domain of Job shop scheduling overlaps with other disciplines such as Time limit. His study in Algorithm is interdisciplinary in nature, drawing from both Decision variables and Optimisation algorithm. His Scheduling study frequently draws connections between related disciplines such as Flow shop scheduling.
His main research concerns Benders' decomposition, Algorithm, Mathematical optimization, Job shop scheduling and Critical path method. His work on Optimization problem and Metaheuristic as part of general Algorithm study is frequently linked to Fractal, therefore connecting diverse disciplines of science. His Mathematical optimization research incorporates elements of Theory of computation, Supply chain network and Fuzzy logic.
As part of his studies on Job shop scheduling, Bahman Naderi frequently links adjacent subjects like Decision variables.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The distributed permutation flowshop scheduling problem
B. Naderi;Rubén Ruiz.
Computers & Operations Research (2010)
Iterated Greedy methods for the distributed permutation flowshop scheduling problem
Rubén Ruiz;Quan-Ke Pan;Bahman Naderi.
Omega-international Journal of Management Science (2019)
A scatter search algorithm for the distributed permutation flowshop scheduling problem
Bahman Naderi;Rubén Ruiz.
European Journal of Operational Research (2014)
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness
B. Naderi;M. Zandieh;A. Khaleghi Ghoshe Balagh;V. Roshanaei.
Expert Systems With Applications (2009)
Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan
B. Naderi;R. Tavakkoli-Moghaddam;M. Khalili.
A hybrid multi-population genetic algorithm for the dynamic facility layout problem
Hani Pourvaziri;B. Naderi.
soft computing (2014)
Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness.
B. Naderi;M. Zandieh;V. Roshanaei.
The International Journal of Advanced Manufacturing Technology (2009)
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan
V. Roshanaei;B. Naderi;F. Jolai;M. Khalili.
Algorithms for a realistic variant of flowshop scheduling
B. Naderi;Rubén Ruiz;M. Zandieh.
Computers & Operations Research (2010)
Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
Sajad Karimi;Zaniar Ardalan;B. Naderi;M. Mohammadi.
Applied Mathematical Modelling (2017)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: