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