Matching Items (9)
Filtering by

Clear all filters

149754-Thumbnail Image.png
Description
A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. Compared to the front-end process that is dominated by re-entrant product flows, the back-end process is linear and therefore more suitable for scheduling. However, the production scheduling of the back-end process

A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. Compared to the front-end process that is dominated by re-entrant product flows, the back-end process is linear and therefore more suitable for scheduling. However, the production scheduling of the back-end process is still very difficult due to the wide product mix, large number of parallel machines, product family related setups, machine-product qualification, and weekly demand consisting of thousands of lots. In this research, a novel mixed-integer-linear-programming (MILP) model is proposed for the batch production scheduling of a semiconductor back-end facility. In the MILP formulation, the manufacturing process is modeled as a flexible flow line with bottleneck stages, unrelated parallel machines, product family related sequence-independent setups, and product-machine qualification considerations. However, this MILP formulation is difficult to solve for real size problem instances. In a semiconductor back-end facility, production scheduling usually needs to be done every day while considering updated demand forecast for a medium term planning horizon. Due to the limitation on the solvable size of the MILP model, a deterministic scheduling system (DSS), consisting of an optimizer and a scheduler, is proposed to provide sub-optimal solutions in a short time for real size problem instances. The optimizer generates a tentative production plan. Then the scheduler sequences each lot on each individual machine according to the tentative production plan and scheduling rules. Customized factory rules and additional resource constraints are included in the DSS, such as preventive maintenance schedule, setup crew availability, and carrier limitations. Small problem instances are randomly generated to compare the performances of the MILP model and the deterministic scheduling system. Then experimental design is applied to understand the behavior of the DSS and identify the best configuration of the DSS under different demand scenarios. Product-machine qualification decisions have long-term and significant impact on production scheduling. A robust product-machine qualification matrix is critical for meeting demand when demand quantity or mix varies. In the second part of this research, a stochastic mixed integer programming model is proposed to balance the tradeoff between current machine qualification costs and future backorder costs with uncertain demand. The L-shaped method and acceleration techniques are proposed to solve the stochastic model. Computational results are provided to compare the performance of different solution methods.
ContributorsFu, Mengying (Author) / Askin, Ronald G. (Thesis advisor) / Zhang, Muhong (Thesis advisor) / Fowler, John W (Committee member) / Pan, Rong (Committee member) / Sen, Arunabha (Committee member) / Arizona State University (Publisher)
Created2011
152082-Thumbnail Image.png
Description
While network problems have been addressed using a central administrative domain with a single objective, the devices in most networks are actually not owned by a single entity but by many individual entities. These entities make their decisions independently and selfishly, and maybe cooperate with a small group of other

While network problems have been addressed using a central administrative domain with a single objective, the devices in most networks are actually not owned by a single entity but by many individual entities. These entities make their decisions independently and selfishly, and maybe cooperate with a small group of other entities only when this form of coalition yields a better return. The interaction among multiple independent decision-makers necessitates the use of game theory, including economic notions related to markets and incentives. In this dissertation, we are interested in modeling, analyzing, addressing network problems caused by the selfish behavior of network entities. First, we study how the selfish behavior of network entities affects the system performance while users are competing for limited resource. For this resource allocation domain, we aim to study the selfish routing problem in networks with fair queuing on links, the relay assignment problem in cooperative networks, and the channel allocation problem in wireless networks. Another important aspect of this dissertation is the study of designing efficient mechanisms to incentivize network entities to achieve certain system objective. For this incentive mechanism domain, we aim to motivate wireless devices to serve as relays for cooperative communication, and to recruit smartphones for crowdsourcing. In addition, we apply different game theoretic approaches to problems in security and privacy domain. For this domain, we aim to analyze how a user could defend against a smart jammer, who can quickly learn about the user's transmission power. We also design mechanisms to encourage mobile phone users to participate in location privacy protection, in order to achieve k-anonymity.
ContributorsYang, Dejun (Author) / Xue, Guoliang (Thesis advisor) / Richa, Andrea (Committee member) / Sen, Arunabha (Committee member) / Zhang, Junshan (Committee member) / Arizona State University (Publisher)
Created2013
157123-Thumbnail Image.png
Description
In the recent past, Iraq was considered relatively rich considering its water resources compared to its surroundings. Currently, the magnitude of water resource shortages in Iraq represents an important factor in the stability of the country and in protecting sustained economic development. The need for a practical, applicable, and sustainable

In the recent past, Iraq was considered relatively rich considering its water resources compared to its surroundings. Currently, the magnitude of water resource shortages in Iraq represents an important factor in the stability of the country and in protecting sustained economic development. The need for a practical, applicable, and sustainable river basin management for the Tigris and Euphrates Rivers in Iraq is essential. Applicable water resources allocation scenarios are important to minimize the potential future water crises in connection with water quality and quantity. The allocation of the available fresh water resources in addition to reclaimed water to different users in a sustainable manner is of the urgent necessities to maintain good water quantity and quality.

In this dissertation, predictive water allocation optimization models were developed which can be used to easily identify good alternatives for water management that can then be discussed, debated, adjusted, and simulated in greater detail. This study provides guidance for decision makers in Iraq for potential future conditions, where water supplies are reduced, and demonstrates how it is feasible to adopt an efficient water allocation strategy with flexibility in providing equitable water resource allocation considering alternative resource. Using reclaimed water will help in reducing the potential negative environmental impacts of treated or/and partially treated wastewater discharges while increasing the potential uses of reclaimed water for agriculture and other applications. Using reclaimed water for irrigation is logical and efficient to enhance the economy of farmers and the environment while providing a diversity of crops, especially since most of Iraq’s built or under construction wastewater treatment plants are located in or adjacent to agricultural lands. Adopting an optimization modelling approach can assist decision makers, ensuring their decisions will benefit the economy by incorporating global experiences to control water allocations in Iraq especially considering diminished water supplies.
ContributorsAhmed, Ahmed Abdulrazzaq (Author) / Mays, Larry W. (Thesis advisor) / Fox, Peter (Thesis advisor) / Mascaro, Giuseppe (Committee member) / Muenich, Rebecca (Committee member) / Arizona State University (Publisher)
Created2019
153883-Thumbnail Image.png
Description
A model is presented for real-time, river-reservoir operation systems. It epitomizes forward-thinking and efficient approaches to reservoir operations during flooding events. The optimization/simulation includes five major components. The components are a mix of hydrologic and hydraulic modeling, short-term rainfall forecasting, and optimization and reservoir operation models.

A model is presented for real-time, river-reservoir operation systems. It epitomizes forward-thinking and efficient approaches to reservoir operations during flooding events. The optimization/simulation includes five major components. The components are a mix of hydrologic and hydraulic modeling, short-term rainfall forecasting, and optimization and reservoir operation models. The optimization/simulation model is designed for ultimate accessibility and efficiency. The optimization model uses the meta-heuristic approach, which has the capability to simultaneously search for multiple optimal solutions. The dynamics of the river are simulated by applying an unsteady flow-routing method. The rainfall-runoff simulation uses the National Weather Service NexRad gridded rainfall data, since it provides critical information regarding real storm events. The short-term rainfall-forecasting model utilizes a stochastic method. The reservoir-operation is simulated by a mass-balance approach. The optimization/simulation model offers more possible optimal solutions by using the Genetic Algorithm approach as opposed to traditional gradient methods that can only compute one optimal solution at a time. The optimization/simulation was developed for the 2010 flood event that occurred in the Cumberland River basin in Nashville, Tennessee. It revealed that the reservoir upstream of Nashville was more contained and that an optimal gate release schedule could have significantly decreased the floodwater levels in downtown Nashville. The model is for demonstrative purposes only but is perfectly suitable for real-world application.
ContributorsChe, Daniel C (Author) / Mays, Larry W. (Thesis advisor) / Fox, Peter (Committee member) / Wang, Zhihua (Committee member) / Lansey, Kevin (Committee member) / Wahlin, Brian (Committee member) / Arizona State University (Publisher)
Created2015
154048-Thumbnail Image.png
Description
Vegetative filter strips (VFS) are an effective methodology used for storm water management particularly for large urban parking lots. An optimization model for the design of vegetative filter strips that minimizes the amount of land required for stormwater management using the VFS is developed in this study. The

Vegetative filter strips (VFS) are an effective methodology used for storm water management particularly for large urban parking lots. An optimization model for the design of vegetative filter strips that minimizes the amount of land required for stormwater management using the VFS is developed in this study. The resulting optimization model is based upon the kinematic wave equation for overland sheet flow along with equations defining the cumulative infiltration and infiltration rate.

In addition to the stormwater management function, Vegetative filter strips (VFS) are effective mechanisms for control of sediment flow and soil erosion from agricultural and urban lands. Erosion is a major problem associated with areas subjected to high runoffs or steep slopes across the globe. In order to effect economy in the design of grass filter strips as a mechanism for sediment control & stormwater management, an optimization model is required that minimizes the land requirements for the VFS. The optimization model presented in this study includes an intricate system of equations including the equations defining the sheet flow on the paved and grassed area combined with the equations defining the sediment transport over the vegetative filter strip using a non-linear programming optimization model. In this study, the optimization model has been applied using a sensitivity analysis of parameters such as different soil types, rainfall characteristics etc., performed to validate the model
ContributorsKhatavkar, Puneet N (Author) / Mays, Larry W. (Thesis advisor) / Fox, Peter (Committee member) / Wang, Zhihua (Committee member) / Mascaro, Giuseppe (Committee member) / Arizona State University (Publisher)
Created2015
154329-Thumbnail Image.png
Description
The presence of a rich set of embedded sensors on mobile devices has been fuelling various sensing applications regarding the activities of individuals and their surrounding environment, and these ubiquitous sensing-capable mobile devices are pushing the new paradigm of Mobile Crowd Sensing (MCS) from concept to reality. MCS aims to

The presence of a rich set of embedded sensors on mobile devices has been fuelling various sensing applications regarding the activities of individuals and their surrounding environment, and these ubiquitous sensing-capable mobile devices are pushing the new paradigm of Mobile Crowd Sensing (MCS) from concept to reality. MCS aims to outsource sensing data collection to mobile users and it could revolutionize the traditional ways of sensing data collection and processing. In the meantime, cloud computing provides cloud-backed infrastructures for mobile devices to provision their capabilities with network access. With enormous computational and storage resources along with sufficient bandwidth, it functions as the hub to handle the sensing service requests from sensing service consumers and coordinate sensing task assignment among eligible mobile users to reach a desired quality of sensing service. This paper studies the problem of sensing task assignment to mobile device owners with specific spatio-temporal traits to minimize the cost and maximize the utility in MCS while adhering to QoS constraints. Greedy approaches and hybrid solutions combined with bee algorithms are explored to address the problem.

Moreover, the privacy concerns arise with the widespread deployment of MCS from both the data contributors and the sensing service consumers. The uploaded sensing data, especially those tagged with spatio-temporal information, will disclose the personal information of the data contributors. In addition, the sensing service requests can reveal the personal interests of service consumers. To address the privacy issues, this paper constructs a new framework named Privacy-Preserving Mobile Crowd Sensing (PP-MCS) to leverage the sensing capabilities of ubiquitous mobile devices and cloud infrastructures. PP-MCS has a distributed architecture without relying on trusted third parties for privacy-preservation. In PP-MCS, the sensing service consumers can retrieve data without revealing the real data contributors. Besides, the individual sensing records can be compared against the aggregation result while keeping the values of sensing records unknown, and the k-nearest neighbors could be approximately identified without privacy leaks. As such, the privacy of the data contributors and the sensing service consumers can be protected to the greatest extent possible.
ContributorsWang, Zhijie (Thesis advisor) / Xue, Guoliang (Committee member) / Sen, Arunabha (Committee member) / Li, Jing (Committee member) / Arizona State University (Publisher)
Created2016
154333-Thumbnail Image.png
Description
Bioretention basins are a common stormwater best management practice (BMP) used to mitigate the hydrologic consequences of urbanization. Dry wells, also known as vadose-zone wells, have been used extensively in bioretention basins in Maricopa County, Arizona to decrease total drain time and recharge groundwater. A mixed integer nonlinear programming (MINLP)

Bioretention basins are a common stormwater best management practice (BMP) used to mitigate the hydrologic consequences of urbanization. Dry wells, also known as vadose-zone wells, have been used extensively in bioretention basins in Maricopa County, Arizona to decrease total drain time and recharge groundwater. A mixed integer nonlinear programming (MINLP) model has been developed for the minimum cost design of bioretention basins with dry wells.

The model developed simultaneously determines the peak stormwater inflow from watershed parameters and optimizes the size of the basin and the number and depth of dry wells based on infiltration, evapotranspiration (ET), and dry well characteristics and cost inputs. The modified rational method is used for the design storm hydrograph, and the Green-Ampt method is used for infiltration. ET rates are calculated using the Penman Monteith method or the Hargreaves-Samani method. The dry well flow rate is determined using an equation developed for reverse auger-hole flow.

The first phase of development of the model is to expand a nonlinear programming (NLP) for the optimal design of infiltration basins for use with bioretention basins. Next a single dry well is added to the NLP bioretention basin optimization model. Finally the number of dry wells in the basin is modeled as an integer variable creating a MINLP problem. The NLP models and MINLP model are solved using the General Algebraic Modeling System (GAMS). Two example applications demonstrate the efficiency and practicality of the model.
ContributorsLacy, Mason (Author) / Mays, Larry W. (Thesis advisor) / Fox, Peter (Committee member) / Wang, Zhihua (Committee member) / Arizona State University (Publisher)
Created2016
152500-Thumbnail Image.png
Description
As networks are playing an increasingly prominent role in different aspects of our lives, there is a growing awareness that improving their performance is of significant importance. In order to enhance performance of networks, it is essential that scarce networking resources be allocated smartly to match the continuously changing network

As networks are playing an increasingly prominent role in different aspects of our lives, there is a growing awareness that improving their performance is of significant importance. In order to enhance performance of networks, it is essential that scarce networking resources be allocated smartly to match the continuously changing network environment. This dissertation focuses on two different kinds of networks - communication and social, and studies resource allocation problems in these networks. The study on communication networks is further divided into different networking technologies - wired and wireless, optical and mobile, airborne and terrestrial. Since nodes in an airborne network (AN) are heterogeneous and mobile, the design of a reliable and robust AN is highly complex. The dissertation studies connectivity and fault-tolerance issues in ANs and proposes algorithms to compute the critical transmission range in fault free, faulty and delay tolerant scenarios. Just as in the case of ANs, power optimization and fault tolerance are important issues in wireless sensor networks (WSN). In a WSN, a tree structure is often used to deliver sensor data to a sink node. In a tree, failure of a node may disconnect the tree. The dissertation investigates the problem of enhancing the fault tolerance capability of data gathering trees in WSN. The advent of OFDM technology provides an opportunity for efficient resource utilization in optical networks and also introduces a set of novel problems, such as routing and spectrum allocation (RSA) problem. This dissertation proves that RSA problem is NP-complete even when the network topology is a chain, and proposes approximation algorithms. In the domain of social networks, the focus of this dissertation is study of influence propagation in presence of active adversaries. In a social network multiple vendors may attempt to influence the nodes in a competitive fashion. This dissertation investigates the scenario where the first vendor has already chosen a set of nodes and the second vendor, with the knowledge of the choice of the first, attempts to identify a smallest set of nodes so that after the influence propagation, the second vendor's market share is larger than the first.
ContributorsShirazipourazad, Shahrzad (Author) / Sen, Arunabha (Committee member) / Xue, Guoliang (Committee member) / Richa, Andrea (Committee member) / Saripalli, Srikanth (Committee member) / Arizona State University (Publisher)
Created2014
153668-Thumbnail Image.png
Description
Error correcting systems have put increasing demands on system designers, both due to increasing error correcting requirements and higher throughput targets. These requirements have led to greater silicon area, power consumption and have forced system designers to make trade-offs in Error Correcting Code (ECC) functionality. Solutions to increase the efficiency

Error correcting systems have put increasing demands on system designers, both due to increasing error correcting requirements and higher throughput targets. These requirements have led to greater silicon area, power consumption and have forced system designers to make trade-offs in Error Correcting Code (ECC) functionality. Solutions to increase the efficiency of ECC systems are very important to system designers and have become a heavily researched area.

Many such systems incorporate the Bose-Chaudhuri-Hocquenghem (BCH) method of error correcting in a multi-channel configuration. BCH is a commonly used code because of its configurability, low storage overhead, and low decoding requirements when compared to other codes. Multi-channel configurations are popular with system designers because they offer a straightforward way to increase bandwidth. The ECC hardware is duplicated for each channel and the throughput increases linearly with the number of channels. The combination of these two technologies provides a configurable and high throughput ECC architecture.

This research proposes a new method to optimize a BCH error correction decoder in multi-channel configurations. In this thesis, I examine how error frequency effects the utilization of BCH hardware. Rather than implement each decoder as a single pipeline of independent decoding stages, the channels are considered together and served by a pool of decoding stages. Modified hardware blocks for handling common cases are included and the pool is sized based on an acceptable, but negligible decrease in performance.
ContributorsDill, Russell (Author) / Shrivastava, Aviral (Thesis advisor) / Oh, Hyunok (Committee member) / Sen, Arunabha (Committee member) / Arizona State University (Publisher)
Created2015