Li Haibing

Haibing Li

Information about the author Haibing Li will soon be added to the site.
Found 7 papers in total
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
2008
We are interested in the problem of scheduling orders for different product types in a...
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
2007
We consider the scheduling of orders in an environment with m uniform machines in...
Order scheduling in an environment with dedicated resources in parallel
Order scheduling in an environment with dedicated resources in parallel
2005
We consider m machines in parallel with each machine capable of producing one specific...
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
2006
We consider the problem of scheduling orders on identical machines in parallel. Each...
Scheduling orders for multiple product types with due date related objectives
Scheduling orders for multiple product types with due date related objectives
2006
We consider m machines in parallel with each machine capable of producing one specific...
Open shops with jobs overlap – revisited
Open shops with jobs overlap – revisited
2005
In this communication we consider a two machine open shop in which a job requires...
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
2003
In this paper, we propose a metaheuristic based on annealing-like restarts to...
Papers per page: