Prof. Ahmed Hariri | King AbdulAziz University (KAU) Jeddah, Saudi Arabia (original) (raw)

Papers by Prof. Ahmed Hariri

Research paper thumbnail of Single Machine Scheduling to Manimize Total Weighted Late Work

Research paper thumbnail of The resource constrained multi-item inventory problem with price discount: a geometric programming approach

Production Planning & Control, 1995

... AHMED MA HARIRI is an associate professor of operations research and head of the Statistics D... more ... AHMED MA HARIRI is an associate professor of operations research and head of the Statistics Department at King Abdul-Aziz University,Jeddah, Saudi Arabia. He graduated from Keele University, England in 1982 with a PhD in operations research. ...

Research paper thumbnail of Multi-item production lot-size inventory model with varying order cost under a restriction: A geometric programming approach

Production Planning & Control, 1997

... MO Abou-El-Ata, Department of Mathematics, Zagazig University, Banha branch, Shoubra, Cairo, ... more ... MO Abou-El-Ata, Department of Mathematics, Zagazig University, Banha branch, Shoubra, Cairo, Egypt AHMED MA HARIRI is an associate professor of operations research and head of the Statistics Department at the faculty of Science, King Abdul-Aziz University, Jeddah ...

Research paper thumbnail of Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs

Management Science, 1994

... of Tardy Jobs AMA Hariri * CN Potts Department of Statistics, King Abdul-Aziz University, Jed... more ... of Tardy Jobs AMA Hariri * CN Potts Department of Statistics, King Abdul-Aziz University, Jeddah, Saudi Arabia Faculty of Mathematical Studies, University of Southampton, United Kingdom ... ( 1975 ) (which generalizes an earlier result of Elmaghraby (1968)) shows that there ...

Research paper thumbnail of Two-Machine Flowshop Scheduling to Minimize the Number of Tardy Jobs

The Journal of the Operational Research Society, 1997

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

Journal of Scheduling, 2005

This paper considers the problem of scheduling a single machine to minimize the number of late jo... more This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10.

Research paper thumbnail of A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop

European Journal of Operational Research, 1989

The problem of scheduling n jobs in an m-machine permutation flow-shop is considered. Each job re... more The problem of scheduling n jobs in an m-machine permutation flow-shop is considered. Each job requires processing on machines 1 ..... m in that order. The processing order of jobs is to be the same for each machine. A due date for each job is specified that represents the time by which it should ideally be completed. The objective is to schedule the jobs so that the number completed after their due dates is minimized. A lower bound, which is obtained by solving a single machine subproblem, is derived. Also, two improvement procedures which consider all subproblems together are developed. A branch and bound algorithm that uses these lower bounds is described. Computational experience with the algorithm is reported.

Research paper thumbnail of A branch and bound algorithm for the two-stage assembly scheduling problem

European Journal of Operational Research, 1997

... bound algorithm for the two-stage assembly scheduling problem AMA Hariria'*, CN ... more ... bound algorithm for the two-stage assembly scheduling problem AMA Hariria'*, CN Pottsb a Department of Statistics, King Abdul-Aziz University, PO ... In particular, the problem is stronglyNP-hard, and there exists an optimal permutation schedule in which the same processing ...

Research paper thumbnail of Algorithms for two-machine flow-shop sequencing with precedence constraints

European Journal of Operational Research, 1984

ABSTRACT

Research paper thumbnail of An algorithm for single machine sequencing with release dates to minimize maximum cost

Discrete Applied Mathematics, 1989

The problem of scheduling jobs on a single machine with release dates, precedence constraints and... more The problem of scheduling jobs on a single machine with release dates, precedence constraints and general cost functions is considered. An algorithm of the branch-and-bound type for minimizing maximum cost is proposed. The algorithm is based on the eliminative properties of a block of jobs. Dominance relations between lower bounds are discussed and some heuristic methods for minimizing maximum cost are analyzed. Computational experiments reveal the high efficiency of the algorithm; it has solved test problems with 300 jobs.

Research paper thumbnail of The M/M/c/N queue with balking and reneging

Computers & Operations Research, 1992

Scope and Purpose-The truncated queuemg models. especially those with both reneging and balking, ... more Scope and Purpose-The truncated queuemg models. especially those with both reneging and balking, tit many real-life problems, such as those arising in communication systems, machine manning, banks and military forces. This paper introduces an analytical solution in terms of the hypergeometric function. For specific values of the parameters, the solution can easily be found using a computer.

Research paper thumbnail of Heuristics for scheduling unrelated parallel machines

Computers & Operations Research, 1991

... synonymously. *Ahmed MA Hariri is Assistant Professor of Operations Research at King Abdul-Az... more ... synonymously. *Ahmed MA Hariri is Assistant Professor of Operations Research at King Abdul-Aziz University, Jeddah, Saudi Arabia. He graduated from the University ofKeele, England in 1982 with a Ph.D. in Operational Research. ...

Research paper thumbnail of Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms

Computers & Industrial Engineering, 2002

ABSTRACT In this research the problem of scheduling n jobs to minimize the Total Weighted Late Wo... more ABSTRACT In this research the problem of scheduling n jobs to minimize the Total Weighted Late Work (TWLW) is evaluated within the single machine context. As the problem complexity increases, so does the solution complexity, and often the objective is to identify a heuristic or algorithm that may return a near optimal solution. Various scheduling rules, heuristics and algorithms, including the weighted shortest processing rule, a variation of the modified due date rule, a genetic algorithm, neighborhood job search, and space smoothing with neighborhood job search, are empirically evaluated using different parameters to determine the utility of each approach.

Research paper thumbnail of Single machine scheduling with batch set-up times to minimize maximum lateness

Annals of Operations Research, 1997

... AMA Hariri Department of Statistics, King Abdul-Aziz University, PO Box 9028, Jeddah 21413, S... more ... AMA Hariri Department of Statistics, King Abdul-Aziz University, PO Box 9028, Jeddah 21413, Saudi Arabia ... in scheduling is surveyed by Potts and Van Wassenhove [5]. For our maximum lateness problem, Bruno and Downey [1] show that, for arbitrary F, the problem is NP-hard ...

Research paper thumbnail of Scheduling a two-stage hybrid flow shop with parallel machines at the first stage

Annals of Operations Research, 1997

This paper considers a non-preemptive two-stage hybrid flow shop problem in which the first stage... more This paper considers a non-preemptive two-stage hybrid flow shop problem in which the first stage contains several identical machines, and the second stage contains a single machine. Each job is to be processed on one of the first-stage machines, and then on the second-stage machine. The objective is to find a schedule which minimizes the maximum completion time or makespan. The problem is NP-hard in the strong sense, even when there are two machines at the first stage. Several lower bounds are derived and are tested in a branch and bound algorithm. Also, constructive heuristics are presented, and a descent algorithm is proposed. Extensive computational tests with up to 250 jobs, and up to 10 machines in the first stage, indicate that some of the heuristics consistently generate optimal or near-optimal solutions.

Research paper thumbnail of Sedimentological and Petrophysical Characterization of the Cogollo Group, Cretaceous, Block IX, Maracaibo Lake

AAPG Bulletin, 1993

ABSTRACT

Research paper thumbnail of Sedimentological and Petrophysical Characterization of the Cogollo Group, Cretaceous, Block IX, Maracaibo Lake

AAPG Bulletin, 1993

ABSTRACT

Research paper thumbnail of Single Machine Scheduling to Manimize Total Weighted Late Work

Research paper thumbnail of The resource constrained multi-item inventory problem with price discount: a geometric programming approach

Production Planning & Control, 1995

... AHMED MA HARIRI is an associate professor of operations research and head of the Statistics D... more ... AHMED MA HARIRI is an associate professor of operations research and head of the Statistics Department at King Abdul-Aziz University,Jeddah, Saudi Arabia. He graduated from Keele University, England in 1982 with a PhD in operations research. ...

Research paper thumbnail of Multi-item production lot-size inventory model with varying order cost under a restriction: A geometric programming approach

Production Planning & Control, 1997

... MO Abou-El-Ata, Department of Mathematics, Zagazig University, Banha branch, Shoubra, Cairo, ... more ... MO Abou-El-Ata, Department of Mathematics, Zagazig University, Banha branch, Shoubra, Cairo, Egypt AHMED MA HARIRI is an associate professor of operations research and head of the Statistics Department at the faculty of Science, King Abdul-Aziz University, Jeddah ...

Research paper thumbnail of Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs

Management Science, 1994

... of Tardy Jobs AMA Hariri * CN Potts Department of Statistics, King Abdul-Aziz University, Jed... more ... of Tardy Jobs AMA Hariri * CN Potts Department of Statistics, King Abdul-Aziz University, Jeddah, Saudi Arabia Faculty of Mathematical Studies, University of Southampton, United Kingdom ... ( 1975 ) (which generalizes an earlier result of Elmaghraby (1968)) shows that there ...

Research paper thumbnail of Two-Machine Flowshop Scheduling to Minimize the Number of Tardy Jobs

The Journal of the Operational Research Society, 1997

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

Journal of Scheduling, 2005

This paper considers the problem of scheduling a single machine to minimize the number of late jo... more This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10.

Research paper thumbnail of A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop

European Journal of Operational Research, 1989

The problem of scheduling n jobs in an m-machine permutation flow-shop is considered. Each job re... more The problem of scheduling n jobs in an m-machine permutation flow-shop is considered. Each job requires processing on machines 1 ..... m in that order. The processing order of jobs is to be the same for each machine. A due date for each job is specified that represents the time by which it should ideally be completed. The objective is to schedule the jobs so that the number completed after their due dates is minimized. A lower bound, which is obtained by solving a single machine subproblem, is derived. Also, two improvement procedures which consider all subproblems together are developed. A branch and bound algorithm that uses these lower bounds is described. Computational experience with the algorithm is reported.

Research paper thumbnail of A branch and bound algorithm for the two-stage assembly scheduling problem

European Journal of Operational Research, 1997

... bound algorithm for the two-stage assembly scheduling problem AMA Hariria'*, CN ... more ... bound algorithm for the two-stage assembly scheduling problem AMA Hariria'*, CN Pottsb a Department of Statistics, King Abdul-Aziz University, PO ... In particular, the problem is stronglyNP-hard, and there exists an optimal permutation schedule in which the same processing ...

Research paper thumbnail of Algorithms for two-machine flow-shop sequencing with precedence constraints

European Journal of Operational Research, 1984

ABSTRACT

Research paper thumbnail of An algorithm for single machine sequencing with release dates to minimize maximum cost

Discrete Applied Mathematics, 1989

The problem of scheduling jobs on a single machine with release dates, precedence constraints and... more The problem of scheduling jobs on a single machine with release dates, precedence constraints and general cost functions is considered. An algorithm of the branch-and-bound type for minimizing maximum cost is proposed. The algorithm is based on the eliminative properties of a block of jobs. Dominance relations between lower bounds are discussed and some heuristic methods for minimizing maximum cost are analyzed. Computational experiments reveal the high efficiency of the algorithm; it has solved test problems with 300 jobs.

Research paper thumbnail of The M/M/c/N queue with balking and reneging

Computers & Operations Research, 1992

Scope and Purpose-The truncated queuemg models. especially those with both reneging and balking, ... more Scope and Purpose-The truncated queuemg models. especially those with both reneging and balking, tit many real-life problems, such as those arising in communication systems, machine manning, banks and military forces. This paper introduces an analytical solution in terms of the hypergeometric function. For specific values of the parameters, the solution can easily be found using a computer.

Research paper thumbnail of Heuristics for scheduling unrelated parallel machines

Computers & Operations Research, 1991

... synonymously. *Ahmed MA Hariri is Assistant Professor of Operations Research at King Abdul-Az... more ... synonymously. *Ahmed MA Hariri is Assistant Professor of Operations Research at King Abdul-Aziz University, Jeddah, Saudi Arabia. He graduated from the University ofKeele, England in 1982 with a Ph.D. in Operational Research. ...

Research paper thumbnail of Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms

Computers & Industrial Engineering, 2002

ABSTRACT In this research the problem of scheduling n jobs to minimize the Total Weighted Late Wo... more ABSTRACT In this research the problem of scheduling n jobs to minimize the Total Weighted Late Work (TWLW) is evaluated within the single machine context. As the problem complexity increases, so does the solution complexity, and often the objective is to identify a heuristic or algorithm that may return a near optimal solution. Various scheduling rules, heuristics and algorithms, including the weighted shortest processing rule, a variation of the modified due date rule, a genetic algorithm, neighborhood job search, and space smoothing with neighborhood job search, are empirically evaluated using different parameters to determine the utility of each approach.

Research paper thumbnail of Single machine scheduling with batch set-up times to minimize maximum lateness

Annals of Operations Research, 1997

... AMA Hariri Department of Statistics, King Abdul-Aziz University, PO Box 9028, Jeddah 21413, S... more ... AMA Hariri Department of Statistics, King Abdul-Aziz University, PO Box 9028, Jeddah 21413, Saudi Arabia ... in scheduling is surveyed by Potts and Van Wassenhove [5]. For our maximum lateness problem, Bruno and Downey [1] show that, for arbitrary F, the problem is NP-hard ...

Research paper thumbnail of Scheduling a two-stage hybrid flow shop with parallel machines at the first stage

Annals of Operations Research, 1997

This paper considers a non-preemptive two-stage hybrid flow shop problem in which the first stage... more This paper considers a non-preemptive two-stage hybrid flow shop problem in which the first stage contains several identical machines, and the second stage contains a single machine. Each job is to be processed on one of the first-stage machines, and then on the second-stage machine. The objective is to find a schedule which minimizes the maximum completion time or makespan. The problem is NP-hard in the strong sense, even when there are two machines at the first stage. Several lower bounds are derived and are tested in a branch and bound algorithm. Also, constructive heuristics are presented, and a descent algorithm is proposed. Extensive computational tests with up to 250 jobs, and up to 10 machines in the first stage, indicate that some of the heuristics consistently generate optimal or near-optimal solutions.

Research paper thumbnail of Sedimentological and Petrophysical Characterization of the Cogollo Group, Cretaceous, Block IX, Maracaibo Lake

AAPG Bulletin, 1993

ABSTRACT

Research paper thumbnail of Sedimentological and Petrophysical Characterization of the Cogollo Group, Cretaceous, Block IX, Maracaibo Lake

AAPG Bulletin, 1993

ABSTRACT