What is he best known for?
The fields of study he is best known for:
- Mathematical optimization
- Algorithm
- Artificial intelligence
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 most cited work include:
- A survey of scheduling problems with setup times or costs (1058 citations)
- A review of scheduling research involving setup considerations (758 citations)
- The third comprehensive survey on scheduling problems with setup times/costs (216 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Job shop scheduling (72.81%)
- Mathematical optimization (70.18%)
- Heuristics (39.47%)
What were the highlights of his more recent work (between 2013-2021)?
- Job shop scheduling (72.81%)
- Mathematical optimization (70.18%)
- Tardiness (11.40%)
In recent papers he was focusing on the following fields of study:
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.
Between 2013 and 2021, his most popular works were:
- The third comprehensive survey on scheduling problems with setup times/costs (216 citations)
- A survey of scheduling problems with no-wait in process (96 citations)
- The two stage assembly flowshop scheduling problem to minimize total tardiness (46 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Mathematical optimization
- Artificial intelligence
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.
