Browsing by Author "Sari, Zaki"

Now showing 1 - 3 of 3

Citation - WoS: 6
Citation - Scopus: 9
Comparative Study Between Continuous Models and Discrete Models for Single Cycle Time of a Multi-Aisles Automated Storage and Retrieval System With Class Based Storage
(Elsevier Science Bv, 2016) Ouhoud, A.; Guezzen, A.; Sari, Zaki
In this work, we arc interested to a problem of storage assignment in automated storage and retrieval system (AS/RS), and more particularly class based storage in multi-aisles AS/RS. In the first part, we developed a continuous approach. The latter is an analytical approach based on continuous approximation of the various discrete distributions modeling the exact horizontal and vertical movements of the S/R machine in each class A, B and C. Subsequently, the proposed models are validated by comparing them with discrete model. For this, we have studied several configurations to compare the results given by the discrete model and continuous model. Filially, the obtained results show that these two models arc very close to each other. This is expected because the developed expressions arc continuous approximation of discrete data. (C) 2016, IFAC(International Federation of Automatic Control) Hosting by Elsevier Ltd. All right reserved.
Citation - WoS: 13
Citation - Scopus: 16
Heuristics for Solving Flow Shop Scheduling Problem Under Resources Constraints
(Elsevier Science Bv, 2016) Laribi, Imane; Yalaoui, Farouk; Belkaid, Faycal; Sari, Zaki
Most of traditional scheduling problems deal with machine as the only resource however, other resources such as raw materials is often disregards. Considering the second resource makes scheduling problems more realistic and practical to implement in manufacturing industries. Due to the applicability of flow shop environment in different manufacturing, scheduling of these types of shops are extensively studied by several authors. However, introducing an additional resource in this environment is not well studied. The present work deals with makespan minimization in flow shop scheduling problems where no renewable resources constraints are considered. The paper illustrates the importance of Johnson (1954) algorithm for the two machine flow shop tinder resources constraints. A mathematical model is also presented. Then a well-know heuristic is adapted to propose fast solution for the m machines flow shop problem subject to resource constraint. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Citation - WoS: 30
Citation - Scopus: 33
Method for Evaluating the Throughput Performance of Shuttle Based Storage and Retrieval Systems
(Univ Osijek, Tech Fac, 2016) Lerher, Tone; Ekren, Banu Y.; Sari, Zaki; Rosi, Bojan
In this paper a method for throughput performance calculation of shuttle based storage and retrieval systems (SBSRS) is presented. SBS RS represent a new technology in automated storage and retrieval systems. Since it is important to design SBS RS right the first time due to the relative inflexibility of the physical layout, we provide a proposed method for the throughput performance calculation of these systems. The performance of the system is considered as a throughput capacity of the SBS RS as a whole.