The scientist’s investigation covers issues in Job shop scheduling, Mathematical optimization, Flow shop scheduling, Heuristics and Scheduling. His Job shop scheduling research integrates issues from Algorithm and Genetic algorithm. His Holding cost study in the realm of Mathematical optimization interacts with subjects such as Approximate solution, Idle time, In real life and Ball screw.
His Heuristics research incorporates themes from Particle swarm optimization, Tabu search and Heuristic. His Scheduling study deals with Operations research intersecting with Job shop, Dynamic priority scheduling, Johnson's rule and Stochastic process. His Job shop study combines topics in areas such as Sequence-dependent setup and Open shop.
His primary scientific interests are in Job shop scheduling, Mathematical optimization, Heuristics, Flow shop scheduling and Completion time. His Job shop scheduling research is multidisciplinary, relying on both Simulated annealing, Algorithm and Scheduling. His Heuristics research is multidisciplinary, incorporating elements of Evolutionary algorithm, Genetic algorithm, Tabu search and Heuristic.
His Flow shop scheduling research incorporates elements of Stochastic process and Operations research. Ali Allahverdi focuses mostly in the field of Operations research, narrowing it down to matters related to Dynamic priority scheduling and, in some cases, Fair-share scheduling. His study in Job shop is interdisciplinary in nature, drawing from both Sequence-dependent setup and Open shop.
His primary areas of investigation include Job shop scheduling, Mathematical optimization, Tardiness, Simulated annealing and Scheduling. His Job shop scheduling research includes themes of Completion time, Algorithm and Confidence interval. His work on Heuristics as part of general Mathematical optimization research is frequently linked to Dominance relation, Approximation error and Measure, bridging the gap between disciplines.
The various areas that he examines in his Heuristics study include Constructive heuristic and Heuristic. His Scheduling study combines topics from a wide range of disciplines, such as Industrial engineering and Flow shop scheduling. Ali Allahverdi studied Flow shop scheduling and Operations research that intersect with Operations management.
Ali Allahverdi spends much of his time researching Job shop scheduling, Mathematical optimization, Scheduling, Simulated annealing and Completion time. Ali Allahverdi conducts interdisciplinary study in the fields of Mathematical optimization and Approximation error through his research. His Scheduling research includes elements of Open shop, Flow shop scheduling, Job shop and Operations research.
His Operations research study incorporates themes from Nurse scheduling problem and Work in process, Operations management. His studies in Simulated annealing integrate themes in fields like Genetic algorithm and Tardiness. His Completion time research is multidisciplinary, incorporating perspectives in Heuristics, Heuristic and Single-machine scheduling.
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.
A survey of scheduling problems with setup times or costs
Ali Allahverdi;C.T. Ng;T.C.E. Cheng;Mikhail Y. Kovalyov.
A review of scheduling research involving setup considerations
Ali Allahverdi;Jatinder N.D Gupta;Tariq Aldowaisan.
The third comprehensive survey on scheduling problems with setup times/costs
European Journal of Operational Research (2015)
Efflorescence control in geopolymer binders based on natural pozzolan
Ebrahim Najafi Kani;Ali Allahverdi;John L. Provis.
Cement & Concrete Composites (2012)
The significance of reducing setup times/setup costs
Ali Allahverdi;H.M. Soroush.
European Journal of Operational Research (2008)
Hydrogels as intelligent materials: A brief review of synthesis, properties and applications
Mostafa Mahinroosta;Zohreh Jomeh Farsangi;Ali Allahverdi;Zahra Shakoori.
Materials Today Chemistry (2018)
New heuristics for no-wait flowshops to minimize makespan
Tariq Aldowaisan;Ali Allahverdi.
Computers & Operations Research (2003)
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
Ali Allahverdi;Fawaz S. Al-Anzi.
Computers & Operations Research (2006)
A survey of scheduling problems with no-wait in process
European Journal of Operational Research (2016)
NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME
Tariq Aldowaisan;Ali Allahverdi.
Omega-international Journal of Management Science (2004)
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: