The following pages link to Fayez F. Boctor (Q168081):
Displayed 38 items.
- A heuristic for the multi-period petrol station replenishment problem (Q933502) (← links)
- The petrol station replenishment problem with time windows (Q955625) (← links)
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
- Offsetting inventory replenishment cycles to minimize storage space (Q1046100) (← links)
- A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes (Q1266549) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- (Q1390260) (redirect page) (← links)
- Multiple items procurement under stochastic nonstationary demands (Q1390261) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- The inventory replenishment planning and staggering problem: a bi-objective approach (Q1653354) (← links)
- An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case (Q1681264) (← links)
- A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
- Heuristics for the traveling purchaser problem (Q1870801) (← links)
- A tabu search heuristic for the multi-depot vehicle routing problem (Q1919200) (← links)
- Heuristics for the multi-depot petrol station replenishment problem with time windows (Q1926745) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- A heuristic for the routing and carrier selection problem (Q2371384) (← links)
- The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops (Q2709462) (← links)
- Solving a vehicle-routing problem arising in soft-drink distribution (Q3182656) (← links)
- Heuristics for the<i>N</i>-product,<i>M</i>-stage, economic lot sizing and scheduling problem with dynamic demand (Q3369501) (← links)
- (Q3718471) (← links)
- The <i>G</i>-group heuristic for single machine lot scheduling (Q3755218) (← links)
- The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem (Q3941152) (← links)
- Sequencing, lot sizing and scheduling of several products in job shops: The common cycle approach (Q4245562) (← links)
- The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops (Q4497049) (← links)
- Efficient heuristics for Median Cycle Problems (Q4661131) (← links)
- Models and algorithms for the dynamic-demand joint replenishment problem (Q4671273) (← links)
- A Multiple-rule Heuristic for Assembly Line Balancing (Q4834088) (← links)
- An Improved Petal Heuristic for the Vehicle Routeing Problem (Q4887791) (← links)
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem (Q5284221) (← links)
- An exact algorithm for the petrol station replenishment problem (Q5387398) (← links)
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers (Q5387416) (← links)
- Minimisation Du Coût De Disponibilité Des Ressources D’un Projet Sous Contrainte De Temps Par Une Adaptation De La Méthode Tabou (Q5888260) (← links)
- The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops. (Q5928378) (← links)
- The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic (Q5945322) (← links)
- Choix De Sites D’Entrepôts Pour Les Autobus De Transport Urbain : Le Cas Du Reséau De Transport De La Capitale (Q6043225) (← links)