An algorithm for single machine sequencing with release dates to minimize total weighted completion time. - A. M. A. Hariri; Chris N. Potts (Discret. Appl. Math., 1983)

Heuristics for scheduling unrelated parallel machines. - A. M. A. Hariri; Chris N. Potts (Comput. Oper. Res., 1991)

The M/M/c/N queue with balking and reneging. - M. O. Abou-El-Ata; A. M. A. Hariri (Comput. Oper. Res., 1992)

Single Machine Scheduling to Minimize Total Weighted Late Work. - A. M. A. Hariri; Chris N. Potts; Luk N. Van Wassenhove (INFORMS J. Comput., 1995)

Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. - Jatinder N. D. Gupta; A. M. A. Hariri; Chris N. Potts (Ann. Oper. Res., 1997)

Single machine scheduling with batch set-up times to minimize maximum lateness. - A. M. A. Hariri; Chris N. Potts (Ann. Oper. Res., 1997)

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)

Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs. - Jatinder N. D. Gupta; A. M. A. Hariri; Chris N. Potts (Ann. Oper. Res., 1999)