Sharif Digital Repository

The classical economic batch quantity (EBQ) model assumes that all produced items have a perfect quality. But in real-life production systems, generation of defective items is inevitable. A portion of these defective items is considered to be scrap , while the other is assumed to be reworkable and reworking them can reduce costs and increase productivity. In this thesis we have studied the economic batch quantity for a single stage production system with rework and scrapping . We want to satisfy the customer demand and minimize total costs of the system like set up costs , production costs , rework costs , holding costs , shortage costs and scrapping costs . In the first chapter of this... 

Based on the latest statistical figures, more than 50 billion Rials worth of medical equipment exists in Iran’s medical centers. In spite of this, Breakdown maintenance is used in all hospitals, which means that the equipment is utilized as long as it is not out of order and only in such a situation, i.e. a breakdown, the necessary repair operation is conducted on the equipment. In fact, no maintenance is carried out to prevent a breakdown, while the “prevention from breakdown” concept has long been introduced in the majority of industries in many countries including Iran and its positive impacts are undisputable. This thesis aims at proposing a solution for the implementation of a “planned... 

EOQ and EPQ models have been among the most important and commonly used techniques for about 100 and 60 years respectively .But, they are involved in some assumptions that sometimes prevent them from being implemented in real situation of industry and production. One of these unrealistic assumptions is that all of items received or produced are of perfect quality. In order to overcome this constraint and make the mentioned models closer to the real environmentsome researches have been done. To this end,following the previous attemptsin this project we assumed to have destructive inspections and existence of imperfect and rejected items after rework. In our models, considering 3 circumstances... 

Hub and Spoke networks come into play when considering direct link between all origins and destinations is either impossible or expensive in a transportation system. In this kind of problems, some nodes are chosen as hub from all origin and destination nodes to collect flows and then distribute them. Implementing hub network leads to minimizing transportation cost, sorting flows and conveying them in economies of scale. Otherwise, shipping flows directly may cause decreasing the travelling distance and the delivery time consequently. In this dissertation, combination of hub network and direct shipment is investigated. To obtain the optimal hub locations and direct links between non-hub nodes... 

This dissertation attempts to develop four inventory control models for two-echelon supply chains. For the all models, the retailers face Poisson demand and lost sales during a stockout. There is also a time-dependent holding cost and a cost per unit of lost sales. However, there is no (or negligible) cost associated with placing an order.
For the first model, we consider a two-echelon inventory system with one central warehouse and a number of retailers. The central warehouse applies (R, Q) policy and retailers apply base stock policy. In this model, we approximate the arrival process of the central warehouse and obtain the total cost of the system, as well as the optimal solution.... 

Production scheduling is such a key issue that directly influences on the performance of the machines and efficiency of production line. This category of problems is to find simultaneously the lot sizes and their sequence over a finite set of planning periods.
In this Thesis a multi objective production planning and job shop scheduling problem is investigated. The objectives are minimization of the production cost and minimization of production time smoothness in consecutive periods. As the problem is shown to be NP-hard, two multi-objectives genetic algorithms with two approaches in selection of parents and crowding distance index are proposed to solve this problem. In these two meta... 

This research deals with a supply chain consisting of one vendor and several retailers. Every retailer orders a fixed discrete quantity in fixed discrete time intervals. Order quantity and order cycle of each retailer could be different from the others. The vendor orders the required quantity to a supplier to fulfill the received demands. Also the vendor orders a discrete quantity, which will be immediately received at the vendor’s warehouse. In this supply chain system, the lead-time is assumed to be zero and shortage is allowed for vendor. The aim is to find minimum vendor’s inventory cost. We proposed a backward Dynamic Programming algorithm for the model. The algorithm creates vendor’s... 

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... 

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.... 

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...