Fayez F. Boctor

According to our database1, Fayez F. Boctor authored at least 25 papers between 1996 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Single-machine capacitated lot-sizing and scheduling with delivery dates and quantities.
Int. J. Prod. Res., 2022

2019
The cold rolling mill scheduling problem: Some solution methods.
Comput. Ind. Eng., 2019

2018
An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case.
Eur. J. Oper. Res., 2018

The inventory replenishment planning and staggering problem: a bi-objective approach.
4OR, 2018

2012
Heuristics for the multi-depot petrol station replenishment problem with time windows.
Eur. J. Oper. Res., 2012

2010
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars.
Eur. J. Oper. Res., 2010

Offsetting inventory replenishment cycles to minimize storage space.
Eur. J. Oper. Res., 2010

2009
The petrol station replenishment problem with time windows.
Comput. Oper. Res., 2009

Optimal and heuristic solution methods for a multiprocessor machine scheduling problem.
Comput. Oper. Res., 2009

2008
An exact algorithm for the petrol station replenishment problem.
J. Oper. Res. Soc., 2008

A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers.
J. Oper. Res. Soc., 2008

A heuristic for the multi-period petrol station replenishment problem.
Eur. J. Oper. Res., 2008

2007
A heuristic for the routing and carrier selection problem.
Eur. J. Oper. Res., 2007

2006
Solving a vehicle-routing problem arising in soft-drink distribution.
J. Oper. Res. Soc., 2006

2004
Efficient heuristics for Median Cycle Problems.
J. Oper. Res. Soc., 2004

2003
Heuristics for the traveling purchaser problem.
Comput. Oper. Res., 2003

2002
A sweep-based algorithm for the fleet size and mix vehicle routing problem.
Eur. J. Oper. Res., 2002

Perturbation heuristics for the pickup and delivery traveling salesman problem.
Comput. Oper. Res., 2002

2001
The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
Eur. J. Oper. Res., 2001

The multi-product, economic lot-sizing problem in flow shops: the powers-of-two heuristic.
Comput. Oper. Res., 2001

2000
A heuristic for the pickup and delivery traveling salesman problem.
Comput. Oper. Res., 2000

The column-circular, subsets-selection problem: complexity and solutions.
Comput. Oper. Res., 2000

1998
An efficient composite heuristic for the symmetric generalized traveling salesman problem.
Eur. J. Oper. Res., 1998

1996
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem.
INFORMS J. Comput., 1996

A tabu search heuristic for the multi-depot vehicle routing problem.
Comput. Oper. Res., 1996


  Loading...