A. M. A. Hariri

According to our database, A. M. A. Hariri authored at least 8 papers between 1983 and 1999.

Collaborative distances:

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

1999

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

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

Single machine scheduling with batch set-up times to minimize maximum lateness.

A. M. A. Hariri, Chris N. Potts

Ann. Oper. Res., 1997

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

1995

Single Machine Scheduling to Minimize Total Weighted Late Work.

A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove

INFORMS J. Comput., 1995

1992

The <i>M/M/c/N</i> queue with balking and reneging.

M. O. Abou-El-Ata, A. M. A. Hariri

Comput. Oper. Res., 1992

1991

Heuristics for scheduling unrelated parallel machines.

A. M. A. Hariri, Chris N. Potts

Comput. Oper. Res., 1991

1983

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