H. A. J. Crauwels

According to our database, H. A. J. Crauwels authored at least 4 papers between 1997 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2005

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs.

H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove

J. Sched., 2005

1998

Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem.

H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove

INFORMS J. Comput., 1998

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time.

H. A. J. Crauwels, A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove

Ann. Oper. Res., 1998

1997

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time.

H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove

Ann. Oper. Res., 1997