Search the dblp DataBase
Haibing Li :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Haibing Li , Andrew Lim A Metaheuristic for the Pickup and Delivery Problem with Time Windows. [Citation Graph (0, 0)][DBLP ] ICTAI, 2001, pp:160-0 [Conf ] Haibing Li , Andrew Lim Local search with annealing-like restarts to solve the vehicle routing problem with time windows. [Citation Graph (0, 0)][DBLP ] SAC, 2002, pp:560-565 [Conf ] Haibing Li , Andrew Lim , Brian Rodrigues A Hybrid AI Approach for Nurse Rostering Problem. [Citation Graph (0, 0)][DBLP ] SAC, 2003, pp:730-735 [Conf ] Joseph Y.-T. Leung , Haibing Li , Michael Pinedo Scheduling orders for multiple product types to minimize total weighted completion time. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:8, pp:945-970 [Journal ] Haibing Li , Andrew Lim A Metaheuristic for the Pickup and Delivery Problem with Time Windows. [Citation Graph (0, 0)][DBLP ] International Journal on Artificial Intelligence Tools, 2003, v:12, n:2, pp:173-186 [Journal ] Joseph Y.-T. Leung , Haibing Li , Michael Pinedo Order Scheduling in an Environment with Dedicated Resources in Parallel. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2005, v:8, n:5, pp:355-386 [Journal ] Joseph Y.-T. Leung , Haibing Li , Michael Pinedo Scheduling orders for multiple product types with due date related objectives. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2006, v:168, n:2, pp:370-389 [Journal ] Joseph Y.-T. Leung , Haibing Li , Michael Pinedo , Chelliah Sriskandarajah Open shops with jobs overlap - revisited. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:163, n:2, pp:569-571 [Journal ] Haibing Li , Andrew Lim Local search with annealing-like restarts to solve the VRPTW. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2003, v:150, n:1, pp:115-127 [Journal ] Joseph Y.-T. Leung , Haibing Li , Michael Pinedo , Jiawei Zhang Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:103, n:3, pp:119-129 [Journal ] Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays. [Citation Graph (, )][DBLP ] Minimizing total completion time in two-machine flow shops with exact delays. [Citation Graph (, )][DBLP ] Search in 0.052secs, Finished in 0.053secs