The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Moshe Dror: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Moshe Dror, Melvin F. Shakun
    Reengineering and Adaptation in Evolutionary Interactive Multi-Objective Linear Programming. [Citation Graph (0, 0)][DBLP]
    HICSS (3), 1996, pp:502-514 [Conf]
  2. Gary Knotts, Moshe Dror, Bruce Hartman
    A Project Management Tool for Computer-Supported Cooperative Work During Project Planning. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1998, pp:623-631 [Conf]
  3. Daniel Dajun Zeng, James C. Cox, Moshe Dror
    Coordination of Purchasing and Bidding Activities across Markets. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  4. Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell
    Touring a sequence of polygons. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:473-482 [Conf]
  5. Moshe Dror, Larry Levy
    A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1986, v:13, n:1, pp:33-45 [Journal]
  6. Joseph Kreimer, Moshe Dror
    The monotonicity of the threshold detection probability in a stochastic accumulation process. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1990, v:17, n:1, pp:63-71 [Journal]
  7. Helman I. Stern, Moshe Dror
    Routing electric meter readers. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1979, v:6, n:4, pp:209-223 [Journal]
  8. Moshe Dror
    Openshop Scheduling with Machine Dependent Processing Times. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:3, pp:197-205 [Journal]
  9. Moshe Dror, Gilbert Laporte, Pierre Trudeau
    Vehicle routing with split deliveries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:3, pp:239-254 [Journal]
  10. Sanja Petrovic, Yong Yang, Moshe Dror
    Case-based selection of initialisation heuristics for metaheuristic examination timetabling. [Citation Graph (0, 0)][DBLP]
    Expert Syst. Appl., 2007, v:33, n:3, pp:772-785 [Journal]
  11. Moshe Dror, Yusin Lee, James B. Orlin, Valentin Polishchuk
    The Tsp and the Sum of its Marginal Values. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:333-344 [Journal]
  12. Axel W. Krings, Moshe Dror
    Real-Time Dispatching: Scheduling Stability and Precedence. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:313-328 [Journal]
  13. Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo
    Scheduling Chains to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:6, pp:297-301 [Journal]
  14. Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung
    Tree Precedence in Scheduling: The Strong-Weak Distinction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:127-134 [Journal]
  15. Daniel Dajun Zeng, James C. Cox, Moshe Dror
    Coordination of purchasing and bidding activities across posted offer and auction markets. [Citation Graph (0, 0)][DBLP]
    Inf. Syst. E-Business Management, 2007, v:5, n:1, pp:25-46 [Journal]
  16. Moshe Dror, Bruce Hartman, Gary Knotts, Daniel Dajun Zeng
    Randomized distributed access to mutually exclusive resources. [Citation Graph (0, 0)][DBLP]
    JAMDS, 2005, v:9, n:1, pp:1-18 [Journal]
  17. Moshe Dror, Benjamin T. Smith, Martin Trudeau
    Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1994, v:10, n:2, pp:216-229 [Journal]
  18. Moshe Dror, Mohamed Haouari
    Generalized Steiner Problems and Other Variants. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:4, pp:415-436 [Journal]
  19. Daniel Dajun Zeng, Moshe Dror, Hsinchun Chen
    Efficient scheduling of periodic information monitoring requests. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:173, n:2, pp:583-599 [Journal]
  20. Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak
    On the complexity of a restricted list-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:103-109 [Journal]

  21. Scheduling malleable tasks with interdependent processing rates: Comments and observations. [Citation Graph (, )][DBLP]


  22. 'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002