Moshe Dror - Citegraph

Author Info

Name	Affiliation	Papers
MOSHE DROR	MIS Department, College of Business & Public Administration, University of Arizona, Tucson, AZ 85712, USA	49
Collaborators	Citations	PageRank
60	574	64.77
Referers	Referees	References
1003	666	415

Search Limit

1001000

Publications (49 rows)

Collaborators (60 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Serving many masters: an agent and his principals	0	0.34	2019
Elicitation of Strategies in Four Variants of a Round-Robin Tournament: The Case of Goofspiel.	0	0.34	2016
Teaching & Learning Guide for Speech Variation, Utility, and Game Theory.	0	0.34	2014
Speech Variation, Utility, and Game Theory.	1	0.40	2013
Universal number partition problem with divisibility	0	0.34	2012
Survey of cooperative inventory games and extensions	15	0.83	2011
'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders	1	0.36	2010
Packing Shelves With Items That Divide The Shelves' Length: A Case Of A Universal Number Partition Problem	1	0.43	2010
Behavioral & Quantitative Game Theory Conference on Future Directions May 14–16, 2010, Fairmont Hotel, Newport Beach, CA	0	0.34	2010
Deux Chemicals Inc. Goes Just-In-Time	0	0.34	2009
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets	5	0.47	2008
Scheduling malleable tasks with interdependent processing rates: Comments and observations	1	0.37	2008
Shipment Consolidation: Who Pays for It and How Much?	24	2.08	2007
Coordination of purchasing and bidding activities across posted offer and auction markets	2	0.40	2007
Case-based selection of initialisation heuristics for metaheuristic examination timetabling	18	0.80	2007
Investigating Ahuja-Orlin's Large Neighbourhood Search Approach for Examination Timetabling	50	1.78	2007
A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem.	0	0.34	2007
Improved bounds for vehicle routing solutions	4	0.48	2006
The Tsp And The Sum Of Its Marginal Values	0	0.34	2006
Efficient scheduling of periodic information monitoring requests	4	0.52	2006
Randomized distributed access to mutually exclusive resources	1	0.36	2005
Touring a sequence of polygons	39	1.66	2003
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework	31	1.98	2002
An interactive graphic presentation for multiobjective linear programming	6	0.56	2001
Generalized Steiner Problems and Other Variants	8	0.85	2000
Generalized spanning trees	19	1.60	2000
Cores of Inventory Centralization Games	49	7.42	2000
Tree precedence in scheduling: The strong–weak distinction	1	0.36	1999
Stopping rules for utility functions and the St. Petersburgh gamble	1	0.48	1999
Real-Time Dispatching: Scheduling Stability and Precedence	2	0.42	1999
On the complexity of a restricted list-coloring problem	7	0.61	1999
A project management tool for computer-supported cooperative work during project planning	3	0.46	1998
A project scheduling methodology derivedas an analogue of digital circuit technology	1	0.38	1998
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities	44	3.65	1998
Scheduling chains to minimize mean flow time	7	0.81	1997
Interactive graphical computer application for large-scale cattle feed distribution management	4	0.48	1997
A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem	7	0.76	1997
Three stage generalized flowshop: Scheduling civil engineering projects	4	0.49	1996
Utilizing shelve slots: sufficiency conditions for some easy instances of hard problems	2	0.80	1994
Vehicle routing with split deliveries	78	5.78	1994
Stochastic and Dynamic Models in Transportation	4	0.46	1993
Vehicle routing with stochastic demands and restricted failures	20	2.45	1993
Stochastic Inventory Routing: Route Design with Stockouts and Route Failures	30	3.38	1992
Openshop scheduling with machine dependent processing times	5	0.83	1992
Multiobjective linear programming: another DSS	4	0.91	1991
The monotonicity of the threshold detection probability in a stochastic accumulation process	1	0.75	1990
Postman Tour On A Graph With Precedence Relation On Arcs	17	1.78	1987
A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing	21	4.48	1986
Routing Electric Meter Readers	32	8.17	1979