Saifallah Benjaafar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Saifallah Benjaafar has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Diwakar Gupta
McMaster University
1 shared publication - Mehdi Sheikhzadeh
I2 Technologies , 909 E. Las Colinas Blvd., Irving, TX, 75039, USA
1 shared publication
Latest Publications
- 1 April 2000
- Published by Taylor & Francis in IIE Transactions
- Vol. 32 (4) , 309-322
Design of flexible plant layouts
In this paper, we present an approach for the design of plant layouts in stochastic environments. We consider systems where the, product mix and product demand are subject to variability and where duplicates of the same department type may exist in the same facility. In contrast to a job shop layout, we allow these duplicates to be placed in non-adjacent locations on the plant floor and for flow allocation between pairs of individual departments to be made as a function of the layout and the product demand realization. We present a scenario-based procedure that iteratively solves for layout and flow allocation. We show that having duplicates of the same departments, which can be strategically located in different areas of the plant floor, can significantly reduce material handling cost while effectively hedging against fluctuations in flow patterns and volumes. We show that the effect of duplication is of the diminishing kind, with most of the cost reduction occurring with relatively few duplicates. We also show that the quality of the obtained layouts can be quite insensitive to inaccuracies in estimating demand scenario probabilities.
- 1 April 2000
- Published by Taylor & Francis in IIE Transactions
- Vol. 32 (4) , 309-322
Design of flexible plant layouts
In this paper, we present an approach for the design of plant layouts in stochastic environments. We consider systems where the, product mix and product demand are subject to variability and where duplicates of the same department type may exist in the same facility. In contrast to a job shop layout, we allow these duplicates to be placed in non-adjacent locations on the plant floor and for flow allocation between pairs of individual departments to be made as a function of the layout and the product demand realization. We present a scenario-based procedure that iteratively solves for layout and flow allocation. We show that having duplicates of the same departments, which can be strategically located in different areas of the plant floor, can significantly reduce material handling cost while effectively hedging against fluctuations in flow patterns and volumes. We show that the effect of duplication is of the diminishing kind, with most of the cost reduction occurring with relatively few duplicates. We also show that the quality of the obtained layouts can be quite insensitive to inaccuracies in estimating demand scenario probabilities.
- 1 April 1999
- Published by Taylor & Francis in IIE Transactions
- Vol. 31 (4) , 339-352
Workload allocation in multi-product, multi-facility production systems with setup times
In this article, we model the problem of assigning work to M heterogeneous servers (machines), which arises from exogenous demands for N products, in the presence of nonzero setup times. We seek a workload allocation which minimizes the total expected Work-in-Progress (WIP) inventory. Demands are assumed to arrive according to independent Poisson processes, but the setup and the processing times can have arbitrary distributions. Whenever a machine produces more than one product type, production batch sizes are determined by a group scheduling policy; which is also known as the cyclic-exhaustive polling policy. We formulate the workload allocation problem as a nonlinear optimization problem and then provide several insights gleaned from first order necessary conditions, from numerical examples, and from a close examination of the objective function. For example, we show that increasing either the load or the number of products assigned to a machine, or both, does not necessarily increase its contribution to total WIP. These insights are then used to devise a heuristic workload allocation as well as a lower bound. The heuristic allocation is further refined using a nonlinear optimization algorithm.
- 1 April 1999
- Published by Taylor & Francis in IIE Transactions
- Vol. 31 (4) , 339-352
Workload allocation in multi-product, multi-facility production systems with setup times
In this article, we model the problem of assigning work to M heterogeneous servers (machines), which arises from exogenous demands for N products, in the presence of nonzero setup times. We seek a workload allocation which minimizes the total expected Work-in-Progress (WIP) inventory. Demands are assumed to arrive according to independent Poisson processes, but the setup and the processing times can have arbitrary distributions. Whenever a machine produces more than one product type, production batch sizes are determined by a group scheduling policy; which is also known as the cyclic-exhaustive polling policy. We formulate the workload allocation problem as a nonlinear optimization problem and then provide several insights gleaned from first order necessary conditions, from numerical examples, and from a close examination of the objective function. For example, we show that increasing either the load or the number of products assigned to a machine, or both, does not necessarily increase its contribution to total WIP. These insights are then used to devise a heuristic workload allocation as well as a lower bound. The heuristic allocation is further refined using a nonlinear optimization algorithm.