The following pages link to Moshe Dror (Q210311):
Displaying 50 items.
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- Universal number partition problem with divisibility (Q418873) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution (Q684320) (← links)
- City streets parking enforcement inspection decisions: the Chinese postman's perspective (Q726240) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949) (← links)
- Dynamic realization games in newsvendor inventory centralization (Q926190) (← links)
- Stochastic vehicle routing with modified savings algorithm (Q1065710) (← links)
- Interactive scheme for a MOLP problem given two partial orders: One on variables and one on objectives (Q1095788) (← links)
- Open shop scheduling with machine dependent processing times (Q1201806) (← links)
- Cash flow optimization in delivery scheduling (Q1266620) (← links)
- Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547) (← links)
- Bifurcation and adaptation in evlutionary interactive multiobjective linear programming (Q1268146) (← links)
- A project scheduling methodology derived as an analogue of digital circuit technology (Q1270591) (← links)
- Large-scale, high-priced applications: An introduction (Q1278607) (← links)
- Stopping rules for utility functions and the St. Petersburg gamble (Q1294318) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems (Q1333241) (← links)
- Cores of inventory centralization games (Q1566890) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Generalized Steiner problems and other variants (Q1592840) (← links)
- Tree precedence in scheduling: The strong-weak distinction (Q1606979) (← links)
- A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing (Q1820686) (← links)
- The monotonicity of the threshold detection probability in a stochastic accumulation process (Q1823559) (← links)
- An interactive graphic presentation for multiobjective linear programming. (Q1855057) (← links)
- Managing decentralized inventory and transshipment (Q1939061) (← links)
- Newsvendor games: convex optimization of centralized inventory operations (Q1939101) (← links)
- Serving many masters: an agent and his principals (Q2274149) (← links)
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
- Scheduling malleable tasks with interdependent processing rates: comments and observations (Q2476250) (← links)
- Efficient scheduling of periodic information monitoring requests (Q2496080) (← links)
- Randomized distributed access to mutually exclusive resources (Q2498232) (← links)
- Three stage generalized flowshop: Scheduling civil engineering projects (Q2564880) (← links)
- Resource constrained chain scheduling of UET jobs on two machines (Q2781112) (← links)
- A decomposition approach to the inventory routing problem with satellite facilities (Q2783806) (← links)
- (Q2947403) (← links)
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks (Q3032042) (← links)
- Split delivery routing (Q3035116) (← links)
- Shipment Consolidation: Who Pays for It and How Much? (Q3116056) (← links)
- (Q3309469) (← links)
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem (Q3518833) (← links)
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (Q3544249) (← links)
- PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM (Q3575375) (← links)
- Touring a sequence of polygons (Q3581275) (← links)
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation (Q3777787) (← links)
- Postman tour on a graph with precedence relation on arcs (Q3787808) (← links)
- The Periodic Loading Problem: Formulation And Heuristics (Q3793922) (← links)
