An investigation of free vibrations of a strain gradient Timoshenko beams with the method of initial values

Investigated herein is the free vibrations of beams based on the strain gradient Timoshenko beam theory with the method of initial values. For the vibration of strain-gradient Timoshenko beam (SGTB), the sixth-order ordinary differential equation and three boundary conditions at each end have been obtained by using the Hamilton principle. The effect of the characteristic length on the frequencies of free vibrations is shown. The frequencies of the SGTB are compared to the frequencies of the strain gradient Euler beam (SGEB), classical Timoshenko beam (CTB) and classical Euler beam (CEB). It has been observed that the high-frequency values of conventional and strain-gradient beams are very different. This result can be used to determine the value of the material characteristic length for a nanobeam for which lengthscale effects are believed to be dominant.

     

Predictable scheduling of a single machine with breakdowns and sensitive jobs

Production schedules released to the shop floor have two important functions: allocating shop resources to different jobs to optimize some measure of shop performance and serving as a basis for planning external activities such as material procurement, preventive maintenance and delivery of orders to customers. Schedule modification may delay or render infeasible the execution of external activities planned on the basis of the predictive schedule. Thus it is of interest to develop predictive schedules that can absorb disruptions without affecting planned external activities while maintaining high shop performance. We present a predictable scheduling approach, that inserts additional idle time into the schedule to absorb the impacts of breakdowns. The effects of disruptions on planned support activities are measured by the deviations of job completion times in the realized schedule from those in the predictive schedule. We apply our approach to minimizing total tardiness on a single machine with stochastic machine failures. We then extend the procedure to consider the case where job processing times are affected by machine breakdowns, and provide specialized rescheduling heuristics. Extensive computational experiments show that this approach provides high predictability with minor sacrifices in shop performance.     

A survey of semiconductor supply chain models part I: semiconductor supply chains,strategic network design,and supply chain simulation

Supply chain management issues have become increasingly important to the semiconductor industry over the last two decades due to the global distribution of facilities and increasing numbers of firms specialising in particular stages. This series of three papers reviews the literature on modelling and analysis of the larger semiconductor supply chain. After describing the structure of semiconductor supply chains to provide context for the research efforts, we propose a classification scheme for the relevant literature. The remainder of this paper (Part I) then focuses on Strategic Network Design models for this industry, supply chain coordination through contracting and semiconductor supply chain simulation. Part II discusses Demand Planning, Inventory Management and Capacity Planning, while Part III addresses Master Planning, Production Planning and Demand Fulfilment.     

Heuristics for capacity planning problems with congestion

Motivated by a problem in the semiconductor industry, we develop improved formulations for the problem of planning capacity acquisition and deletion over time when resources are subject to congestion, motivated by a problem in the semiconductor industry. We use nonlinear clearing functions to relate the expected output of a production resource in a planning period to the expected work in process (WIP) inventory level. Exploiting the properties of the clearing function allows us to formulate the single workcenter problem as a shortest path problem. This forms the basis for two greedy constructive heuristics and a Lagrangian heuristic for the multistage problem. The latter procedure also provides lower bounds on the optimal value. We present computational experiments showing that the proposed heuristics obtain high-quality solutions in modest CPU times.     

Sulfur dioxide adsorption by activated carbons having different textural and chemical properties

Activated carbons from Turkish lignite were prepared with different methods to investigate the influence of physico-chemical characteristics of the carbon materials on the sulfur dioxide (SO₂) adsorption. The effects of SO₂ concentration, adsorption temperature, and sample particle size on adsorption were investigated using a thermogravimetric analysis system. An intraparticle diffusion model based on Knudsen diffusion and Freundlich isotherm (or Henry isotherm) was applied for predicting the amount of SO₂ adsorbed. The textural and chemical properties of the activated carbon samples, resulted from the effects of activation conditions and demineralization of the carbon precursor, on the SO₂ adsorption were also analyzed.     

A single-product network design model with lead time and safety stock considerations

Most existing network design and facility location models have focused on the trade-off between the fixed costs of locating facilities and variable transportation costs between facilities and customers. However, operational performance measures such as service levels and lead times are what motivates customers to bring business to a company and should be considered in the design of a distribution network. While some previous work has considered lead times and safety stocks separately, they are closely related in practice, since safety stocks are often set relative to the distribution of demand over the lead time. In this paper we consider a two-stage supply chain with a production facility that replenishes a single product at retailers. The objective is to locate Distribution Centers (DCs) in the network such that the sum of the location and inventory (pipeline and safety stock) costs is minimized. The replenishment lead time at the DCs depends on the volume of flow through the DC. We require the DCs to carry enough safety stock to maintain the prescribed service levels at the retailers they serve. The explicit modeling of the relationship between the flows in the network, lead times and safety stocks allows us to capture the trade-off between them. We develop a Lagrangian heuristic to obtain near-optimal solutions with reasonable computational requirements for large problem instances.     

A survey of semiconductor supply chain models part III: master planning,production planning,and demand fulfilment

Part I of this three-part series described semiconductor supply chains from the decision-making and functional perspectives, using this as a framework to review the industrial engineering (IE) and operations research (OR) literature on the problems arising in these supply chains. Part I then reviewed the literature on Strategic Network Design, Supply Chain Coordination, Sustainability and Semiconductor Supply Chain Simulation, while Part II reviewed Demand Planning, Inventory Management, and Capacity Planning. This paper concludes the series, discussing Master Planning, Production Planning, Demand Fulfilment, and Available to Promise (ATP) in semiconductor supply chains.     

A problem reduction approach for scheduling semiconductor wafer fabrication facilities

Most scheduling procedures used in industry are based on the dispatching paradigm, where decisions are made based on the jobs available at the time the machine becomes free. While optimization-based scheduling procedures have repeatedly been shown to yield significantly better schedules under ideal circumstances, their practical implementation is hampered by high computational requirements. We present a problem reduction procedure that allows a workcenter-based global scheduling heuristic to be implemented in very low CPU times. The procedure partitions the workcenters in a fab into heavily loaded and lightly loaded classes and solves the global scheduling problem only for the heavily loaded workcenters. The proposed technique is tested on instances drawn from an International SEMATECH wafer fab model. The proposed problem reduction approach yields superior results with modest computational effort, enabling the practical use of the decomposition heuristic.