Sharif Digital Repository

The thesis is about transit network scheduling problem and aims to minimize waiting time at transfer stations. The problem is formulated as a mixed integer programing model that gives departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting time. The model is expanded to another model by considering an extra stoping time of vehicles at transfer stations as a new variable set. By calculationg the optimal value for these variables, transfers could be done in a better condition. The sizes of the models are small enough that the models can be solved for small and medium size networks using regular MIP solvers. Moreover, a... 

In this thesis departure programming are studied in general state and takeoff programming studied in special state. Departure programming consists of several parts that decisions for each part may influence in the other parts. Because of unforeseen delays this problem is a dynamic problem. Holding area is a part that overtaking operations performance before takeoff. An initial sequence obtained from ground controller. A heuristic algorithm that used in this thesis is a hybrid of constraint satisfaction and dynamic programming for minimizing sum of the total delays. The performance of the heuristic algorithm is compared with tabu search algorithm. The result shows that the proposed algorithm... 

Improving synchronization in a bus network has a profound effect on reducung waiting times and increasing satisfaction of system’s users. By doing so, the scheduler create a more attractive transit system that generates the opportunity for increasing the number of riders. In this research, the problem of creating timetables with maximum synchronization is modeled as a mixed integer programing (MIP) problem. The objective of this model is to minimize the total waiting times of passengers at transfer nodes. For this purpose, the model take advantage of uneven headways. Some of features that distinguish this research are more realistic objective function, and considering adjacent departures... 

Worldwide interoperability for Microwave Access (WiMAX) is one of the most dominant cell-based broadband wireless metropolitan access technologies. Packet scheduling algorithm specifies the packet transmission order. In WiMAX standard, packet scheduling algorithm is not defined and its efficient design is left for developers and researchers. The existing researches in the scope of uplink packet scheduling, which is the most challenging packet scheduling scheme, consider only one cell. However the uplink available resources might not be enough when there are many packets that should be scheduled. To solve this problem, we propose an algorithm that uses the load balancing mechanisms that are... 

The accessibility of broadband Internet to home users has pushed video broadcasting applications up, in the list of most favorite applications in todays Internet. Such applications involve delivering the data which generated in a single sender to a set of users which are scattered around the world. While it was formerly believed that the IP-Multicasting is the mean to provide this kind of services, the trend has altered to the use of Application Layer Multicasting techniques due to their deployment simplicty. Since their advent, Peer to Peer applications has mitigated many problems previously unsolved in the field of communication. File sharing, distributed file systems, distributed data... 

Recent advances in WSN have led to next generation of it for multimedia transmission which is WMSN. WMSN has several applications like environmental monitoring, advance health care delivery and etc. However, providing QoS requirements of transmitting video data like delay, bandwidth and packet loss with minimum distortion at perceived video quality over WMSN with resource constraints is a challenging problem. Using multipath routing protocol for video communication can increase bandwidth and decrease delay over WMSN. Moreover, all video packets have not the same effect on video distortion. We propose a scheduling mechanism which classifies packets according to their types and contents and... 

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

According to Moor’s law, the number of transistors per chip would double every 1.5 years. It means that the number of processors, memory and hardware cores available on the chip also increases. In SoC, a number of IP cores and communication links or buses are integrated on a chip. According to inefficiency of the interconnection bus used in SoCs for a large number of processors, NoC has been introduced in the beginning of the current decade. In the NoC paradigm a router-based network is used for packet switched on-chip communication among cores. A typical NoC architecture will provide a scalable communication infrastructure for interconnecting cores. One of the most important features of... 

In this research we investigate one of the heuristic algorithms of scheduling, Squeaky Wheel Optimization (SWO) in order to solve an RCPSP problem with minimization of Makespan as the objective function; and we will implement this algorithm on Primavera which is one of the most popular software systems in Project Management. The main purpose of this project is to prepare a way to implement the scheduling algorithms on one of the popular Project Management Software Systems. Hence, we have created an application which can interact with this kind of systems, gets data from their databases, run a scheduling algorithm on it, and updates the data in the databases. One of the main characteristics... 

In recent years peer-to-peer video streaming systems have become the major alternative for traditional client-server models, and several P2P streaming applications have attracted a large number of users on the Internet. In a mesh based P2P streaming architecture a video stream is portioned into video blocks and each peer pulls these video blocks from its neighbors. Since the uplink bandwidth of each peer is its main constraint in transmission video blocks, efficient block scheduling can play an important role in improving the perceived video quality by peers. Moreover, the granularity of video blocks can have a significant impact on the performance of the system. In this thesis, we propose... 

Decreasing travel time is one of the main goals of passengers in urban areas for which transportation operators use various policies. Among these policies, expanding public transportation facilities is one of the urban planner major purposes. Considering the fact that making these facilities needs great investment, optimize use of the current facilities is valuable. Waiting time in transit station has influence on increasing passengers’ travel time and inconsistency, so coordination between different transit lines is necessary. In this thesis, creating coordination among different transit lines in a transit network by the use of integer programming is studied in the form of two models. In... 

The efficient scheduling of independent and sequential tasks on distributed and heterogeneous computing resources within grid computing environments is an NP-complete problem. Therefore, using heuristic approaches to solve the scheduling problem is a very common and also acceptable method in these environments. In this thesis, a new task scheduling algorithm based on bee colony optimization approach is proposed. The algorithm uses artificial bees to appropriately schedule the submitted tasks to the grid resources. Applying the proposed algorithm to the grid computing environments, the maximum delay and finish times of the tasks are reduced.Furthermore, the total makespan of the environment... 

In this Thesis pricing has been used in Job-shop scheduling problem in detailed scheduling point of view. Also, in this study, due date is price-dependent variable in wich the manufacturer has the ability to choose one item from some pairs of prices and due dates for every jobs in order to maximize the total profit, i.e. revenue less scheduling cost. In this problem, total weighted tardiness has been choosen for scheduling cost. In this research, pairs of prices and due dates has been studied. According to the complexity of this problem, a Genetic algorithm has been proposed to solving the problem. As a managerial insight, it shown that joint optimization of pricing and scheduling decisions... 

Resource sharing is one of the most interesting features of grid computing. These resources can include CPU, main memory, secondry memory, network bandwith, or data. How to allocate these resources to the tasks remains a complex problem in this domain. The concentration of this thesis is on workflow scheduling. In this case, the works are composed of several tasks, in the way that some tasks have control or data dependency with others. In other words, we have to schedule a DAG (Directed Acyclic Graph) representation of tasks on limited proceccing units. The principle of workflow scheduling optimization is to minimize the makespan, but in the economic scheduling, cost reduction beside... 

The constrained nonlinear systems with large operating regions have attracted great attention due to their correspondence with the most practical systems. There are several tools such as gain scheduling and Nonlinear Model Predictive Control (NMPC) to control them. Gain scheduling, with ability to provide stability guarantees between the estimated stability regions overlapping each other and to cover a large space of the allowable operating range of the system, is an attractive practical approach to control the systems with large operating regions. But this strategy do not account for constraints explicitly by online optimization. On the contrary, NMPC handles constraints on the manipulated... 

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

Computational grids enabling resource sharing and coordination are now one of the common and acceptable technologies used for solving computational intensive applications rising in scientific and industrial problems. Nevertheless, due to the heterogeneity, dynamicity and autonomy of the grid resources, task scheduling within these systems has become a challenging research area. Applying the market model to the grids is a good approach which can easily take the dynamic characteristics of the grid resources into account and simplify the scheduling problem considering user-centric factors.In this thesis a two level market-based model for task scheduling problem in grid environment is presented.... 

Prolonging the lifetime of wireless sensor networks (WSN) is one of the most important goals in the sensor network research. A lot of work has been done to achieve this goal. Since sensor nodes normally have limited resources in terms of energy, bandwidth and computation capability, efficiency is a key design goal in sensor network research. Data aggregation is a very important method to conserve energy by eliminating the inherent redundancy of raw data in dense WSNs. Previous research on data aggregation has demonstrated its effectiveness in reducing traffic, easing congestion and decreasing the energy consumption. However, few are actually designed for a real world application and... 

This research presents scheduling of several different projects in supply chain environment which activities of these projects are performed by some contractor companies. A new practical model for solving project scheduling problem in supply chain environment is present. Multi renewable resource presents in the model of research. The research proves that the model is NP-Hard. A genetic algorithm and a simulated annealing algorithm are proposed for solving the model. The parameters of genetic algorithm such as the number of steps, the number of mutation in each step, the number of crossover in each step, the number of generation phase and also the parameters of simulated annealing algorithm... 

The most common procedure of operating theatre scheduling in hospitals consists of two major steps called assignment and sequencing. In the first step, patients are assigned to a so called block (part of an operating room time in a specific day). The sequencing step is usually executed a day before the pre-defined day. In this step, the head nurse makes a sequence of the operations while she consults with the relating surgeons and considers all of the conditions and then the patients are informed about their operation time. Although the head nurse does not have a biased look, surgeons usually believe that the schedule is unfair to them. Moreover, the schedule is prepared through trial and...