Hariri A.M.A.

A.M.A. Hariri

Information about the author A.M.A. Hariri will soon be added to the site.
Found 11 papers in total
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
1999
This paper develops a branch and bound algorithm for solving the single-machine...
A branch and bound algorithm for the two-stage assembly scheduling problem
1997
This paper develops a branch and bound algorithm for the two-stage assembly scheduling...
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
1998
This paper presents several branch and bound algorithms for a single-machine...
Single machine scheduling to minimize total weighted late work
1995
In the problem of scheduling a single machine to minimize total weighted late work,...
Two-machine flowshop scheduling to minimize the number of tardy jobs
1997
The authors consider the two-machine flowshop problem with the objective of minimizing...
Single machine scheduling with batch set-up times to minimize maximum lateness
1997
This paper considers a problem of scheduling N jobs on a single machine to minimize...
Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
1997
This paper considers a non-preemptive two-stage hybrid flow shop problem in which the...
Point estimation and confidence intervals of the M/M/2/N queue with balking and heterogeneity
1995
In this paper, the authors present both point estimation and confidence intervals of...
Single machine scheduling with deadlines to minimize the weighted number of tardy jobs
1994
This paper considers a single machine scheduling problem in which jobs have due dates...
Heuristics for scheduling unrelated parallel machines
1991
The problem of non-preemptively scheduling jobs on unrelated parallel machines to...
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
1989
The problem of scheduling n jobs in an m- machine permutation flow-shop is considered....
Papers per page: