Loading...
Search for:
haji--babak
0.114 seconds
Total 345 records
Optimal Assignment of Patients from Emergency Department to Inpatient Hospital Wards
, M.Sc. Thesis Sharif University of Technology ; Haji, Babak (Supervisor)
Abstract
Emergency Department (ED) overcrowding is one the most problems and challenges that every Emergency Department all over the world is facing with. This problem leads to some problems like prolonged waiting times and Length of Stay in Emergency Department. “Boarding time” is one of the most important ones, which is the time a patient spend for being transferred from Emergency Department to one of the Hospital Inpatient Wards. One important solution to this problem is “overflowing”, and it means allocating patients to an alternative ward rather than their primary ward. In practice, the overflowing process usually controlled in a myopic manner. Limited number of researches that focus in this...
Analyzing Networks by Means of Friendship Paradox
, M.Sc. Thesis Sharif University of Technology ; Haji, Babak (Supervisor)
Abstract
Due to the vast application of networks in the modeling of problems, the analysis of networks has been gaining a noticeable importance in recent researches. There are some cases in which we are looking for nodes that are highly connected to other nodes. However, the detailed information of the network structure is not always available; or because of complexity, it is not possible to investigate whole network and pick high-degree nodes; or investigating the network completely is too time-consuming. In such cases, algorithms which do not need the whole network information play a significant role. Friendship paradox as a topological feature of graphs can be helpful in designing such algorithms....
Using Probabilistic Models and Data Mining Techniques in Online Computer Games
, M.Sc. Thesis Sharif University of Technology ; Haji, Babak (Supervisor)
Abstract
Computer video games have had a huge growth in recent years, and Dota 2 is one of the most popular video games and e-sports right now. In this research, Dota 2 drafting phase is studied by using stochastic processes and probabilistic models. This phase is modeled as a POMDP (Partially Observable Markov Decision Process) for the first time. Afterwards, the model is solved using data mining methods and machine learning algorithms. A large database of the game's match data is created, and six different machine learning algorithms are used to predict the match outcome based on the drafting stage. The prediction accuracy and power of these algorithms is compared, and finally, a program is...
A Hybrid Approach for Evaluation and Improvement of Business Process under Uncertainty
, M.Sc. Thesis Sharif University of Technology ; Haji, Babak (Supervisor)
Abstract
Business process management (BPM) is an approach which helps managers to gain success in their organization by becoming capable of identifying and developing their processes. Process improvement is a difficult and important step in BPM since modern organizations have a huge number of processes and activities with complex and complicated relationships and interrelationships. In this work our goal is to rank and prioritize processes based on operational limitations of the organization such as budget, human resources, consumer resources and also relationships among processes have been considered and finally develop a portfolio of processes which are vital and essential for improvement....
A Dynamic Scheduling Model with Multiple Process Planning Scenarios Using Markov Models
, M.Sc. Thesis Sharif University of Technology ; Haji, Babak (Supervisor)
Abstract
Cloud Manufacturing have been provided the proper context for efficient and effective using from distributed and various sources for agile and fast responsiveness to various customer demands. Product request from customers lead to define the operations in shop-floor levels that must be process by production equipment in shop-floors. The planning and scheduling problem of this activities have been most important challenge for decision makers. Therefore, the development of ways and methods can exploit efficiently from distributed resources and in confront of customer reqirement have been adaptive is most important. In this study an adaptive approach can be considered in terms of assigning the...
Optimal Batch Production for a Single Machine System with Rework
, M.Sc. Thesis Sharif University of Technology ; Haji, Ali Reza (Supervisor)
Abstract
This research attempts to develop the optimal solution for an inventory problem consisting of a single machine which produces items some of which may be defective. We assume that no shortages are allowed and all defective items are to be reworked. Setup cost for rework and waiting time of defectives are considered. This research consists of two different parts. In the first part we consider two different policies where in the first policy in each cycle after the regular production the machine is setup for the rework of defectives of the same cycle. In the second policy several cycles constitute a period. All the defectives produced in the period are reworked in the last cycle of that period....
Optimal batch production with rework and non-zero setup cost for rework
, Article 2009 International Conference on Computers and Industrial Engineering, 6 July 2009 through 9 July 2009 ; 2009 , Pages 857-862 ; 9781424441365 (ISBN) ; Haji, R ; Haji, A ; Sharif University of Technology
2009
Abstract
This paper attempts to develop the optimal solution for an inventoryproblem consisting of a single machine which produces items some of which may bedefective. We assume that no shortages are allowed and all defective items areto be reworked. Setup cost for rework and waiting time of defectives areconsidered. We consider two different policies where in the first policy in eachcycle after the regular production the machine is setup for the rework ofdefectives of the same cycle. In the second policy several cycles constitute aperiod. All the defectives produced in the period are reworked in the last cycleof that period. At the end of the rework cycle the whole process starts allover again. One...
One-for-one period policy in a two-echelon inventory system with commoncycle and poisson demand rate for retailers
, Article 2009 International Conference on Computers and Industrial Engineering, CIE 2009 ; 2009 , Pages 831-834 ; 9781424441365 (ISBN) ; Tayebi, H ; Haji, B ; Sharif University of Technology
2009
Abstract
This paper deals with a two-echelon inventory system consisting of onesupplier and N retailers. Each retailer faces an independent Poisson demand withthe same rate and applies a new ordering policy called one-for-one- periodordering policy for its inventory control. In this ordering policy the ordersize is equal to one and the time interval between any two consecutive ordersforms a common fixed cycle. Thus, the supplier faces a deterministic demand andadopts a deterministic inventory policy. At each cycle he orders a batch of sizeN to his own supplier. Upon receipt of each batch he sends 1 unit of theproduct to each retailer with a transportation cost. In this paper, for theabove system we...
Revenue sharing contract for a VMI with one for one period policy
, Article Cogent Engineering ; Volume 5, Issue 1 , 2018 , Pages 1-19 ; 23311916 (ISSN) ; Afzalabadi, M ; Haji, R ; Sharif University of Technology
Cogent OA
2018
Abstract
In this article, we design a revenue-sharing contract to coordinate inventory control decisions in a serial supply chain consisting of one supplier, one vendor, and one retailer. We assume that the retailer faces Poisson demand and his unsatisfied demands will be lost. The retailer applies one-for-one period policy in which he constantly places an order for one unit of product to the vendor in a predetermined time interval which results in a deterministic demand for the vendor. Vendor orders the required quantity from supplier which will be immediately received at the vendor’s warehouse. Solution procedures are developed to find the equilibrium in the vendor managed inventory program with a...
Pricing and inventory decisions in a vendor managed inventory system with revenue sharing contract
, Article Uncertain Supply Chain Management ; Volume 6, Issue 3 , 2018 , Pages 299-320 ; 22916822 (ISSN) ; Afzalabadi, M ; Haji, R ; Sharif University of Technology
Growing Science
2018
Abstract
In this paper, we design a revenue sharing contract to coordinate pricing and inventory control decisions in a serial supply chain consisting of one supplier, one manufacturer and one retailer. We assume that the retailer faces Poisson demand and his unsatisfied demands will be lost. The retailer applies one-for-one period policy in which he constantly places an order for one unit of product to the manufacturer in a predetermined time interval which results in a deterministic demand for the manufacturer. Solution procedures are developed to find the equilibrium in the Vendor Managed Inventory (VMI) program with a revenue sharing contract, in which no party is willing to deviate from for the...
Developing a partial backlogging deteriorating inventory model with selling price dependant demand rate and cycle length dependant selling price
, Article 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008, Singapore, 8 December 2008 through 11 December 2008 ; January , 2008 , Pages 198-202 ; 9781424426300 (ISBN) ; Sabahno, H ; Haji, R ; Sharif University of Technology
2008
Abstract
In this paper, we develop an inventory model with price dependant demand rate, under time value of money and inflation, finite time horizon, exponential backlogging rate and exponential deterioration rate with the objective of maximizing the present worth of the total system profit. Using a dynamic programming based solution algorithm, we are able to find the optimal sequence of the cycles and also to obtain different optimal selling prices and optimal order quantities for the cycles with unequal lengths, which have never been done before for our model. We also use a proper numerical example to show accuracy of the solution procedure. © 2008 IEEE
One-for-one period policy and a series of suppliers
, Article 2009 International Conference on Computers and Industrial Engineering, CIE 2009, 6 July 2009 through 9 July 2009, Troyes ; 2009 , Pages 902-906 ; 9781424441365 (ISBN) ; Pirayesh Neghab, M ; Haji, A ; Sharif University of Technology
2009
Abstract
The purpose of this paper is to adopt and analyze a new ordering policycalled one-for-one-period policy in a multi-echelon supply chain consisting ofone retailer and a series of TV suppliers. The main advantage of adopting theone-for-one-period (7,7) ordering policy for retailers is the elimination ofuncertainty for supplier which leads to total elimination of the safety stocksat all suppliers. This in turn leads to the reduction of the total system costsand in case any supplier's ordering cost is negligible it can even eliminate theneed for him to carry any inventory. In addition to this advantage, thenumerical results show that the application of this new policy for the retailerleads to...
Optimal batch production with minimum rework cycles and constraint on accumulated defective units
, Article 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, SOLI 2009, Chicago, IL, 22 July 2009 through 24 July 2009 ; 2009 , Pages 633-638 ; 9781424435418 (ISBN) ; Haji, A. R ; Haji, R ; Sharif University of Technology
2009
Abstract
This paper deals with the issue of economic batch quantity (EBQ) in a single machine system in which defective items are produced in each cycle of production. The accumulated defective items produced in a period, consisting of several equal cycles, are all reworked in the last cycle of this period called the rework cycle. At the end of each period the whole process will start all over again. We assume that there is a limitation on the total defective items. We also do not adopt the restriction that the rework process rate be equal to the normal production rate. In addition we assume that there is a set up time for rework process. Further we assume that the number of rework cycles be as small...
Economic production quantity with accumulated rework
, Article 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Taipei, 20 June 2006 through 23 June 2006 ; 2006 , Pages 4196-4203 ; Tavakol, A. R ; Haji, B ; Sharif University of Technology
2006
Abstract
This paper deals with the issue of economic batch quantity (EBQ) in a single machine system in which defective items are produced in each cycle of production. The defective items produced in the first N cycles are accumulated at the end of the Nth cycle and are all reworked in a separate cycle called the rework cycle which has the same length as the other cycles and begins just at the end of the Nth cycle. At the end of the rework cycle the whole process will start all over again. For this system, assuming no shortages are permitted we obtain the economic batch quantity which minimizes the total cost
Multi-Echelon Mixed-loop Supply Chain Network Design under Disruption Conditions
, M.Sc. Thesis Sharif University of Technology ; Haji, Rasoul (Supervisor) ; Haji, Alireza (Supervisor)
Abstract
Fulfilling the demands of customers, used to be the main purpose of Supply Chain Network Designers. Soon after that, the environmental concerns created the concept of Reverse Logistic in order to prevent goods from being scattered in the environment after their disposal. Governmental regulations and people's concerns, forced the factories to gather the created pollutions of the environment. They gradualy confessed the positive impacts of these ruturns on their financials. The flow of forward and reverse logistics establishes a Closed-Loop in which the returning economical circumstances were transferd into original factories. Later, Open-Loops were created. In open-loops the returns have to...
Inventory Control Dynamic Models in Decentralized Supply Chain with Coordination
, Ph.D. Dissertation Sharif University of Technology ; Haji, Alireza (Supervisor) ; Haji, Rasoul (Co-Advisor)
Abstract
Although inventory control under discrete demand in dynamic quantities and time intervals are very common in reality, existing literature has largely ignored them. In this thesis, we investigate the inventory control decisions in a two echelon supply chain. The vendor supplies a product to several retailers, buying discrete quantities in pre-determined time intervals. The order quantity and order cycles for each retailer can be different from others. We have developed a new efficient algorithm to find the optimal ordering policy involves the scheduling and the order quantity of vendor to his supplier to minimize his cost function in infinite time horizon. Moreover, we have designed a revenue...
Prediction of Financial Markets Using Combination of Artificial Intelligence and Technical Analysis
, M.Sc. Thesis Sharif University of Technology ; Haji, Alireza (Supervisor)
Abstract
Generally, nowadays, machine learning methods are used in many different areas for their superiority over other methods of prediction. Although being a tough task, stock market prediction with machine learning approaches is being spread due to satisfying results published ever yday. Machine learning methods usually use varied kinds of data ,including structured data such as market data, technical indicators and some fundamental data as well as unstructured one entailing text and graph data in order to enhance their predictability capacity. In this thesis we aimed to find out more about the importance and the contribution of structured data in prediction and we tried to attain a framework...
Introducing a new ordering policy in a two-echelon inventory system with Poisson demand
, Article International Journal of Production Economics ; Volume 117, Issue 1 , 2009 , Pages 212-218 ; 09255273 (ISSN) ; Neghab, M. P ; Baboli, A
Elsevier
2009
Abstract
In this paper we introduce a new ordering policy for inventory control in a two-echelon inventory system consisting of one central warehouse and a number of non-identical retailers. The warehouse uses a modified one-for-one policy, but the retailers apply a new policy which is different from the traditional inventory policies described in the literature of inventory and production control systems. In this system, each retailer constantly places an order for one unit of product to the central warehouse in a pre-determined time interval; i.e., the time interval between any two consecutive orders from each retailer is a fixed number and the quantity of each order is one. We then show how the...
Stabilized Meshless Local Petrov-Galerkin (MLPG) method for incompressible viscous fluid flows
, Article CMES - Computer Modeling in Engineering and Sciences ; Volume 29, Issue 2 , 2008 , Pages 75-94 ; 15261492 (ISSN) ; Sharif University of Technology
2008
Abstract
In this paper, the truly Meshless Local Petrov-Galerkin (MLPG) method is extended for computation of steady incompressible flows, governed by the Navier-Stokes equations (NSE), in vorticity-stream function formulation. The present method is a truly meshless method based on only a number of randomly located nodes. The formulation is based on two equations including stream function Poisson equation and vorticity advection-dispersion-reaction equation (ADRE). The meshless method is based on a local weighted residual method with the Heaviside step function and quartic spline as the test functions respectively over a local subdomain. Radial basis functions (RBF) interpolation is employed in shape...
Meshless local petrov-galerkin (MLPG) method for incompressible viscous fluid flows
, Article 2006 2nd ASME Joint U.S.-European Fluids Engineering Summer Meeting, FEDSM 2006, Miami, FL, 17 July 2006 through 20 July 2006 ; Volume 2006 , 2006 ; 0791837831 (ISBN); 9780791837832 (ISBN) ; Sharif University of Technology
2006
Abstract
In this paper, the truly Meshless Local Petrov-Galerkin (MLPG) method is extended for computation of unsteady incompressible flows, governed by the Navier-Stokes equations (NSE), in vorticity-stream function formulation. The present method is a truly meshless method based only on a number of randomly located nodes. The formulation is based on two equations including stream function Poisson equation and vorticity advection-dispersion-reaction eq. (ADRE). The meshless method is based on a local weighted residual method with the Heaviside step function and quartic spline as the test functions respectively over a local subdomain. Moving Least Square approximation (MLS) is employed in shape...