Sharif Digital Repository

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

Nurse scheduling problem has received a great amount of attention during recent years. In this problem number of needed nurses from different skill levels is given for each Location-shift during planning horizon, and the goal is to allocate each nurse to shifts, such that the demand of each location-shift is satisfied. Many researches have been done with the aim of minimizing the number of needed nurses to satisfy the demand of locationshifts or maximizing nurses preferences to work in desired shifts. In this research an integer programming model is proposed to minimize the number of needed nurses and maximize nurses preferences simultaneously. The proposed mathematical model is appropriate... 

This research deals with the Unrelated Parallel Machine Scheduling (UPMS) problem with sequence dependent setup times and release dates and machines eligibility. The studied objective is the minimization of total tardiness and earliness.The due dates and release times of the jobs are distinct which complicates the problem. Two mixed linear integer programming models proposed to solve the research problem optimally in small size instances.The problem is shown to be NP-hard in the strong sense.As it is not possible to solve medium and large size instances in approporaite time, a metaheuristic algorithm based on tabu search developed. Several versions of algorithm are obtained based on... 

The traditional point of view on the scheduling of the healthcare systems, which is in common with the scheduling of other service and manufacturing systems, has contributed to inattention to patients’ psychological status and has given rise to many negative effects not only on them, but also on hospitals. However, this perspective has not been modified yet with respect to the features of healthcare systems, in which patients, rather that machines, are the main entities of the system. In this study, to address this draw back, a new concept, psyche-based optimization, as well as a new scheduling problem, anxiety-based scheduling of operating rooms, as the advent of this concept, have been... 

The present thesis is focused upon the flow shop sequence dependent group scheduling problem (FSDGS) with no wait assumption. Generally, production sequencing and scheduling is considered as one of the most important factors in productivity and cost saving of organizations. Therefore, determining an appropriate sequencing of groups and jobs according to the logical constraints is expected to improve the performance and productivity of the production system.
In this thesis, due to the importance and multiple applications of this problem, we will consider the FSDGS problem and propose new heuristic and metaheuristic algorithms to tackle this problem. Since the good performance of... 

This study focuses on two-machine flow shop problem where processing times are uncertain and the objective function is makespan. All information available about the processing time is an upper and lower bound and also expected value. The min-max and min-max regret version of the problem are adopted. In this study, in order to control the degree of conservatism of the solution, we suppose in each scenario the number of processing times on each machine that can deviate from its expected value is controllable. By considering the duality theorem, we present a mixed-integer programming model for the min-max problem. For each of two problems, we present an algorithm for finding objective value. We... 

This paper deals with no-wait open shop scheduling with sequence dependent setup times and release dates, minimizing total completion times. In spite of practibility of the problem, there is no substantial work dealing the problem. We present three formulation of the problem based on different decision variable paradigms and investigate some computational and efficacy aspects of the models. For large size problems, we first propose a novel encoding and decoding scheme of and present four particle Swarm Optimization (PSO)-based algorithms and four Tabu Search (TS)-base algorithms. To evaluate the performance of the algorithms we carry out two cpmputational experiments; in the first experiment... 

In this research, a scheduling problem, minimizing the sum of weighted earliness/tardiness in a flow shop sequence-dependent group scheduling (FSDGS) problem, is investigated. In this problem, every job has a distinct due date, early penalty rate, and tardy penalty rate. This problem is typically classified in the literature as F_m | fmls,S_plk,prmu | ∑(w_j^1 E_j+ w_j^2 T_j). A mixed integer linear programming model is developed for the proposed research problem. As the problem is proved to be strongly NP-hard, only small-size problems can be solved with the mathematical model. Thus, a metaheuristic algorithm based on the Particles Swarm Optimization (PSO) algorithm is developed to solve... 

This study addresses the simultaneous berth and quay crane (QC) scheduling problem in a container terminal. The berths are considered as a continuous area and the vessels arrive dynamically. QCs are allowed to move to other vessels before completing the process on an assigned vessel.The objective function is determined based on the practical applications of the problem. It deals with minimization of sum of the completion time of vessels. In this research, a mathematical model has been developed for the research problem. According to NP-hardness of the research problem, two meta heuristic algorithms based on Tabu Search are proposed. To solve the problem, these methods have two layers with... 

This study strives to solve the course scheduling problem based on the constraints in Sharif University. In course scheduling problem, first we need to assign each course to a professor (This is done according to professors’ preferences in Sharif University) then we assign each course to a classroom and a time slot subject to professors, classrooms and time constraints (For example no two courses can be assigned to the same classroom at the same time slot). If solved manually, the solving process will take several days and at best results in a feasible solution. The education department is responsible for scheduling 661courses in five days a week and assigning them to 56 classrooms... 

provide about 67% of a hospital’s profit. Hospital managers are interested in decreasing the costs as well as increasing the customers’ satisfaction level. In this Thesis, four Mixed- Integer Programming models for planning and scheduling operating rooms are proposed. In the main, the problem is presented in two phases. In The first phase, model assigns the date and the room to each surgical and in second phase the model determines the sequencing of the assigned operation cases. The effects of using three different scheduling strategies (Block and Open and modified block) for assigning operating rooms to surgeons on the planning of surgical cases is studied. Then we proposed one phase model... 

The most important sources in container terminals are berth and quay cranes. The main purpose in the container terminals is reducing delay times of vessels. This will be obtained with planning of terminal sources. This research addresses simultaneous berth and quay crane scheduling problem. A mixed integer linear mathematical model is proposed to minimize sum of completion time of vessels. Since the proposed research problem is NP-hard, two methahuristic algorithms based on Tabu Search (TS) and Particle Swarm Optimization (PSO) are presented to heuristically solve the problem. After parameter tuning, PSO and TS algorithms are compared with experimental design methods. The results indicate... 

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