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.
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.
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.
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.
Scheduling problems with a learning effect
European Journal of Operational Research (2001)
Scheduling jobs under simple linear deterioration
Computers & Operations Research (1994)
Scheduling with general job-dependent learning curves
Gur Mosheiov;Jeffrey B Sidney.
European Journal of Operational Research (2003)
Parallel machine scheduling with a learning effect
Journal of the Operational Research Society (2001)
V-shaped policies for scheduling deteriorating jobs
Operations Research (1991)
The Travelling Salesman Problem with pick-up and delivery
European Journal of Operational Research (1994)
Vehicle routing with pick-up and delivery: tour-partitioning heuristics
Computers & Industrial Engineering (1998)
Complexity analysis of job-shop scheduling with deteriorating jobs
Discrete Applied Mathematics (2002)
Multi-Machine Scheduling With Linear Deterioration
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
Baruch Mor;Gur Mosheiov.
European Journal of Operational Research (2010)
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.
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: