H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Engineering and Technology H-index 32 Citations 5,371 138 World Ranking 4998 National Ranking 43

Overview

What is he best known for?

The fields of study he is best known for:

  • Mathematical optimization
  • Statistics
  • Scheduling

Gur Mosheiov mainly focuses on Mathematical optimization, Scheduling, Job shop scheduling, Heuristics and Time complexity. His study in the field of Scheduling and Assignment problem also crosses realms of Upper and lower bounds, Sequence and Schedule. His study on Tardiness and Fair-share scheduling is often connected to Project management as part of broader study in Scheduling.

His study looks at the relationship between Fair-share scheduling and fields such as Distributed computing, as well as how they intersect with chemical problems. His Job shop scheduling research is multidisciplinary, relying on both Algorithm and Minification. In his study, Optimal cost is inextricably linked to Asymptotically optimal algorithm, which falls within the broad field of Heuristics.

His most cited work include:

  • Scheduling problems with a learning effect (300 citations)
  • Scheduling with general job-dependent learning curves (269 citations)
  • Scheduling jobs under simple linear deterioration (265 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Mathematical optimization, Scheduling, Job shop scheduling, Time complexity and Tardiness. His study in Mathematical optimization is interdisciplinary in nature, drawing from both Single-machine scheduling and Flow shop scheduling. As part of the same scientific family, Gur Mosheiov usually focuses on Scheduling, concentrating on Heuristics and intersecting with Heuristic.

His study looks at the relationship between Job shop scheduling and topics such as Job scheduler, which overlap with Distributed computing. As part of his studies on Time complexity, Gur Mosheiov frequently links adjacent subjects like Operations research. His research in Dynamic programming intersects with topics in Completion time, Scheduling and Theory of computation.

He most often published in these fields:

  • Mathematical optimization (80.79%)
  • Scheduling (67.55%)
  • Job shop scheduling (37.75%)

What were the highlights of his more recent work (between 2017-2021)?

  • Mathematical optimization (80.79%)
  • Scheduling (67.55%)
  • Dynamic programming (20.53%)

In recent papers he was focusing on the following fields of study:

His primary areas of investigation include Mathematical optimization, Scheduling, Dynamic programming, Job rejection and Job shop scheduling. His work on Scheduling is typically connected to Upper and lower bounds as part of general Mathematical optimization study, connecting several disciplines of science. In Scheduling, Gur Mosheiov works on issues like Theory of computation, which are connected to Tardiness.

His Dynamic programming course of study focuses on Unavailability and Heuristics. Gur Mosheiov merges Job shop scheduling with Supply chain management in his research. His work on Open-shop scheduling and Open shop as part of general Flow shop scheduling research is frequently linked to Window, bridging the gap between disciplines.

Between 2017 and 2021, his most popular works were:

  • Scheduling on a proportionate flowshop to minimise total late work (14 citations)
  • A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (13 citations)
  • Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection (13 citations)

In his most recent research, the most cited papers focused on:

  • Statistics
  • Mathematical optimization
  • Algorithm

Gur Mosheiov focuses on Mathematical optimization, Job shop scheduling, Job rejection, Scheduling and Flow shop scheduling. When carried out as part of a general Mathematical optimization research project, his work on Dynamic programming and Scheduling is frequently linked to work in Position dependent and Absolute deviation, therefore connecting diverse disciplines of study. His study in Dynamic programming intersects with areas of studies such as Upper and lower bounds, Supply chain management and Learning effect.

His Scheduling study frequently draws connections to adjacent fields such as Combinatorial optimization. Position dependent is integrated with Extension, Process, Assignment problem and Subroutine in his study. His work on Open shop and Open-shop scheduling as part of general Flow shop scheduling study is frequently linked to Window, therefore connecting diverse disciplines of science.

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.

Top Publications

Scheduling problems with a learning effect

Gur Mosheiov.
European Journal of Operational Research (2001)

458 Citations

Scheduling jobs under simple linear deterioration

Gur Mosheiov.
Computers & Operations Research (1994)

389 Citations

Scheduling with general job-dependent learning curves

Gur Mosheiov;Jeffrey B Sidney.
European Journal of Operational Research (2003)

370 Citations

Parallel machine scheduling with a learning effect

Gur Mosheiov.
Journal of the Operational Research Society (2001)

286 Citations

V-shaped policies for scheduling deteriorating jobs

Gur Mosheiov.
Operations Research (1991)

249 Citations

The Travelling Salesman Problem with pick-up and delivery

Gur Mosheiov.
European Journal of Operational Research (1994)

234 Citations

Vehicle routing with pick-up and delivery: tour-partitioning heuristics

Gur Mosheiov.
Computers & Industrial Engineering (1998)

162 Citations

Complexity analysis of job-shop scheduling with deteriorating jobs

Gur Mosheiov.
Discrete Applied Mathematics (2002)

137 Citations

Multi-Machine Scheduling With Linear Deterioration

Gur Mosheiov.
Infor (1998)

109 Citations

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

Baruch Mor;Gur Mosheiov.
European Journal of Operational Research (2010)

104 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Gur Mosheiov

Ji-Bo Wang

Ji-Bo Wang

Shenyang Aerospace University

Publications: 91

Chin-Chia Wu

Chin-Chia Wu

Feng Chia University

Publications: 85

T.C.E. Cheng

T.C.E. Cheng

Hong Kong Polytechnic University

Publications: 85

Wen-Chiung Lee

Wen-Chiung Lee

Feng Chia University

Publications: 50

Ping Ji

Ping Ji

Hong Kong Polytechnic University

Publications: 24

Mikhail Y. Kovalyov

Mikhail Y. Kovalyov

National Academy of Sciences of Belarus

Publications: 21

Chengbin Chu

Chengbin Chu

Université Paris Cité

Publications: 20

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 15

Reza Tavakkoli-Moghaddam

Reza Tavakkoli-Moghaddam

University of Tehran

Publications: 14

Mostafa Zandieh

Mostafa Zandieh

Shahid Beheshti University

Publications: 13

S.M.T. Fatemi Ghomi

S.M.T. Fatemi Ghomi

Amirkabir University of Technology

Publications: 12

Lixin Tang

Lixin Tang

Northeastern University

Publications: 11

Chung Yee Lee

Chung Yee Lee

Hong Kong University of Science and Technology

Publications: 11

Feng Chu

Feng Chu

University of Évry Val d'Essonne

Publications: 11

Gilbert Laporte

Gilbert Laporte

HEC Montréal

Publications: 10

Something went wrong. Please try again later.