Sharif Digital Repository

This study strives to minimize a two-criterion objective function of a flexible flow shop scheduling problem with receipt and delivery of jobs in groups and processing them individually. Every group of jobs has a release time, which means that all jobs are not available at the beginning of the planning horizon. Moreover, due to the special characteristics of every job in a group, only a subset of machines at each stage are eligible to process that job. This problem has many applications in production and service industries, such as restaurants and ceramic tile manufacturing companies. The objective function is determined based on the practical applications of the problem. It deals with... 

This research investigates permutation flow shop scheduling problems with sequence-dependent setup times with minimizing the number of tardy jobs as criterion (Fm|prmu, Sijk|ΣUj). A mixed integer linear programming model has been developed for the research problem. As the problem is shown to be NP-hard, several meta-heuristic algorithms based on tabu search (TS) and imperialist competitive algorithm are developed to heuristically solve the problem. In order to find the best meta-heuristic algorithm, random test problems, ranging in size from small, medium, to large are created and solved by the meta-heuristic algorithms. Then, a detailed statistical experiment, based on split-plot design is... 

In this research sequence-dependent flowshop and flexible flowshop group scheduling problems are investigated. Several upper and lower bounding methods are proposed for the research problems. Permutation flowshop sequence-dependent group scheduling problem with minimization of total completion time is considered. Since the problem is shown to be strongly NP-hard, a Memetic algorithm (MA) is proposed. A lower bounding method base on the Branch-and-Price algrithm is also proposed. A statistical comparison shows that both the proposed MA and the proposed lower bounding method have better performance than the other methods from the literature with an average 5.96% percentage gap. Flexible... 

Data mining is the one of top ten developing knowledge in the world. This study followed three fold objectives; Firstly, An efficient model based on data mining algorithms is proposed to predict the duration of hospitalization time for patients of digestive system disease that need short term care. Duration of hospitalization is an important criterion to be used for predicting the hospital resources. In order to, a combined model based on CHAID and C.5 decision trees and a neural network is suggested. The suggested model predict the duration of hospitalization with 82% accuracy. The second object of this study is to propose an algorithm based on likelihood ratio. The suggested algorithm... 

In the present work, the problem of Olympic Games scheduling is investigated. Due to the high number of matches and limited number of resources, scheduling of the Olympic Games is a difficult and time consuming job. Also a balanced distribution of medals on the days of Olympic Games keep each day attractive for the people and prevent sudden changes in the medal ranking of countries. So, in regard to the limitations of the problem and to balance the distribution of medals, the Olympic Games are scheduled. In order to do that, at first, two mathematical models are presented. One of them is for obtaining the feasible and optimum solution in a specified period of time. The other model presents a... 

Due to the undeniable importance and applicability of both "batch processing" and "parallel machines" in service and industry, this survey strives to solve a real-world problem in which some identical parallel machine, capable of processing jobs in batches, are available. In batch processing the process of jobs starts and ends simultaneously. In real world the processing time of the batch is a function of some characteristics of the jobs in the batch. in this survey, for simplicity (as calculating the mentioned function is so difficult), we assume that the processing time of a batch equals the sum of the processing time of the jobs in the batch. we also have assumed that the capacity of a... 

Sports scheduling with its interesting theory and application has been the subject of many research recently. Different problems arise from different league structures with different objectives. Inspired by the structure of soccer leagues in Britain and Netherlands, we study structures in which a different permutation of first half-season rounds is played during second half-season. Some leagues like Premier league in addition to this structure have a special property in which two teams may do not play against each other in the first half-season and play twice in the second half-season. Therefore, we study both structures separately. We present a mathematical model to cover both structures.... 

In this research a no-wait flowshop sequence dependent setup time scheduling problem with weighted earliness-tardiness penalties as the criterion (F_m |nwt,S_ijk |∑▒〖w_j^' E_j+w_j^" T_j 〗) is investigated. It is assumed that n jobs are assigned to a flowshop with m machines. The jobs are not allowed to wait between two successive machines according to no-wait requirement. Moreover each machine needs a setup time before processing a new job. The value of this setup time is dependent on the previous processed job on that machine.
A mixed integer linear programming model is proposed to solve the problem. As the problem is shown to be strongly NP-hard, a particle swarm optimization (PSO)... 

Airplane Landing Scheduling and Gate Assignment are two highly related problems in the literature. Although there is high relationship between these two problems, they have been studied independently from each other in the literature so far. This relation is due to that the input data of gate assignment problem is the output of airplane landing scheduling problem. In this study, an integrated linear programming model is proposed in order to improve the number of planes which are assigned to a jet-way by changing scheduling of their landing. Since this problem is NP-Hard, a meta-heuristic algorithm is based on tabu search (TS) is developed to solve this problem approximately. The proposed TS... 

In this thesis, scheduling of surgery rooms is investigated and the objective is minimizing total patient’s departure time from the ward room in a flexible flow shop manner. Here, some constraints like the capacity of recovery rooms, no-wait motion between the rooms and machine eligibility restrictions ( , Σ ) are considered.For solving this problem,we proposed two mixed integer linear programming models for the research problem. Since the research problem is shown to be NP-complete, we developed several algorithm based on Tabu Search (TS) to heuristically solve it. In TS algorithm two different methods and one neighborhood structures are applied to generate initial solution and... 

Operating rooms (ORs) are considered as the most valuable resource in hospital, which are the largest revenue generator and, at the same time, the largest cost center of hospitals. Hospital managers have been interested in improving the efficiency and effectiveness of ORs by developing modern planning and scheduling tools. This research studies the stochastic operating room (OR) scheduling problem integrated by Post-Anesthesia Care Unit (PACU), named the operating theater room (OTR) problem. Due to the inherent uncertainty in surgery duration and its consecutive PACU time, the completion time of the operation of a patient should be modeled as the sum of a number of random variables. Several... 

This study deals with the heuristic solution of flexible flow shop scheduling problems with unrelated parallel machines. No preemption of jobs is allowed. As an objective function, this paper considers the minimization of total tardiness. As a first step to propose solution, two different mixed integer mathematical models are developed which tackle the problem at hand. The problem is NP-hard and thus the developed mathematical program can only solve problem instances for small sizes in a reasonable amount of time. The next step is to build heuristics which can provide feasible solutions in polynomial time for larger problem instances. Then in the study develops a constructive heuristic for... 

Data mining (DM) is one of the newest techniques which is used in decision making. DM helps the specialist to find the valuable knowledge which is hidden in data, with different techniques. DM has many research areas such as scientific research, medical fields, health care, fraud detection, marketing and customer relationship, sport, and games, and where ever there is data. Unfortunately, in our country, DM is not engaged seriously and there are fallacies of DM that weaken its efficiency. In this thesis, which is prepared in two sections, at the first section different techniques of DM are described and in the second section DM process is performed for a real world problem. For this purpose,... 

Nowadays, finding suppliers of goods and materials is easier than the past, because of developments in communications technology. Therefore, some of supply chains have expanded their relations to global area and select international partners. With an increase in the scope of suppliers available, supplier management sections encounter a large number of suppliers to choose from, and loads of information to process. Therefore proper methods must be adopted in order to evaluate the suppliers. One way is to create credit levels and ranking the suppliers according to past cooperation. Implementation of this method requires the use of tools that provide Comprehensive analysis of the occult rules... 

In this research the risk of oil price for Iran and Opec basket is studied. Several methods in order to estimate Value at Risk (VaR) such as Standard Historical Simulation, Historical Simulation with Autoregressive Forecast, Historical Simulation with moving average forecast, and ARMA are examined. The experiment is performed based on daily oil prices, from January 2005 to December 2009. The data is divided into two smaller time periods. The first, from 2005 to 2008, was used to estimate the model coefficients. The second part of data, i.e., the data gathered in 2009, was used for forecasting purposes. The result of experiment show that Historical Simulation with Autoregressive Forecasts... 

Due to increasing competition, Flexible Manufacturing System (FMS) take more attention in the new world. This flexibility is generally considered to fall into two categories, which both contain numerous subcategories. The first category, machine flexibility, covers the system's ability to be changed to produce new product types, and ability to change the order of operations executed on a part. The second category is called routing flexibility. Due to high variation in parts and low production volume, setup times are important. In this research, Flexible Jobshop Scheduling Problem with Sequence Dependent Setup Time (SDST-FJSP), as an extension of classical Jobshop scheduling problem (JSP), is... 

One of the most applicable fields in data mining is customer relationship management (CRM). CRM process includes four aspects: Customer identification, Customer attraction, Customer retention, and Customer development. Data mining can be a supportive tool for decision making in each of these CRM aspects. Huge volume of data and information corresponding to CRM that exists in companies' databases, has made sufficient potential for data mining process and discovering hidden knowledge. Importance of concepts like customer needs identification, customer retention, and increasing customer value for companies has made the need to use of data mining techniques more valuable. Saipa Yadak Co., as a... 

Train scheduling is one of the most complicated stages of railway planning. In this stage, the arrival and departure times of trains at stations are determined. In this thesis, we studied train scheduling on a two-way and single track railway in order to minimize the total travel times of trains subject to a set of operational constraints and prayer time related constraints that determines the optimal station for prayer. In this project, we tried to simulate the real constraints exist in IRAN railway network and the objective function considers customer’s and railway management’s satisfaction, simultaneously. First, a mathematical programming is proposed for this problem. After demonstrating... 

Sequencing and scheduling of jobs are decision making processes that are used in many manufacturing and service industries. In the traditional scheduling models, it is assumed that the values for all the problem parameters are constant and known in advance. However, production environments in the real world are subject to many sources of uncertainty or randomness. This research investigates three different types of stochastic scheduling problems. In the first case, the problem is minimizing the number of tardy jobs in the class of static list policies, where the job processing times are random variables. For this case, the stochastic problems in single machine and flow shop environments are...