A decision model to determine the number of shuttles in a tier-to-tier SBS/RS

Shuttle-based storage and retrieval systems (SBS/RSs), which are designed to increase throughput capacity and flexibility, are a type of automated storage and retrieval system used for lightweight loads. SBS/RSs can increase throughput capacity by using multiple shuttles and elevators as storage and retrieval machines (SRMs). They can also facilitate improvements in flexibility since they are able to adjust the number of SRMs according to transaction demands. Thus, determining the number of shuttles is an important issue in tier-to-tier SBS/RSs. In this paper, a decision model to determine the number of shuttles is proposed. The model is based on the travel time model, and it considers parameters such as the physical configuration, velocity profile and the probability that the shuttle operates a dual command. Finally, the throughput capacity from the travel time model is compared with that from a simulation-based approach in order to verify the effects of the model. In addition, a critical discussion regarding the characteristics of the tier-to-tier system is provided.     

膜分离技术在电镀镍漂洗水回收中的应用

经过一系列的实验 ,证明了采用膜分离技术浓缩电镀镍漂洗水和回收利用漂洗水中的镍和水资源的可行性 .实验结果表明 ,NF技术对镍离子的截留率大于 97% ,RO技术对镍离子的截留率大于 99% .对于镍离子浓度为 14 5mg/L的进水 ,膜分离技术可浓缩电镀镍漂洗水 10 0倍以上 ,经一级NF ,两级RO(BWRO、SWRO)浓缩 ,浓缩液镍离子浓度可达到 5 0 g/L ,透过液经处理后回用     

A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem

As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.     

Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm

The distributed permutation flowshop scheduling problem (DPFSP) is a newly proposed topic in the shop scheduling field, which has important application in globalised and multi-plant environments. This study presents a modified iterated greedy (MIG) algorithm for this problem to minimise the maximum completion time among all the factories. Compared with previous approaches, the proposed algorithm is simpler yet more effective, more efficient, and more robust in solving the DPFSP. To validate the performance of the proposed MIG algorithm, computational experiments and comparisons are conducted on an extended benchmark problem set of Taillard. Despite its simplicity, the computational results show that the proposed MIG algorithm outperforms all existing algorithms, and the best-known solutions for almost half of instances are updated. This study can be offered as a contribution to the growing body of work on both theoretically and practically useful approaches to the DPFSP.     

A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop

This paper addresses the job shop-scheduling problem with minimizing the number of tardy jobs as the objective. This problem is usually treated as a job-sequencing problem, and the permutation-based representation of solutions was commonly used in the existing search-based approaches. In this paper, the flaw of the permutation-based representation is discussed, and a rule-centric concept is proposed to deal with it. A memetic algorithm is then developed to realize the proposed idea by tailored genome encoding/decoding schemes and a local search procedure. Two benchmark approaches, a multi-start hill-climbing approach and a simulated annealing approach, are compared in the experiments. The results show that the proposed approach significantly outperforms the benchmarks.     

Using analytic hierarchy process to determine process economics in multivariate loss functions

Performance of a product usually depends on several responses (quality characteristics) which must meet all of the specifications simultaneously. This could be achieved by applying of (the) robust design methodology to problems with multiple characteristics. In the literature, several works have been published concerning multi-response optimization methods, which aim to achieve the best possible robustness. One of the approaches for multi-response optimization is Loss Function Approach which allows the practitioner to include variance–covariance structure of the responses, prediction quality and the economic importance of the responses relevant to the product or process. In this paper, we propose utilizing Analytic Hierarchy Process, a multi-criteria decision making tool, to determine the economic importance matrix in the multivariate loss function. An example of the suggested method is presented on a study conducted for a company producing water proof polymer roofing materials.     

Development of a framework to automate process planning functions and to determine machining parameters

A methodology is developed to perform the machining parameter selection function in an automated process planning environment. At the same time, a framework is developed to perform the machine and tool selection function of process planning. The purpose of the machining parameter selection function, as envisioned in this study, is to determine the number of roughing and finishing passes needed, depth of cut, cutting speed, and feed for each pass depending on the part geometry, tolerance, the available machine types and appropriate grades of cutting tools. A new stable cutting region constraint is proposed. A machining-related cost based on tolerance, called measurement and adjustment cost, is derived and included in the formulation. A way to determine maximum roughing depth of cut is indicated. Finally, a part example is used to demonstrate the concepts for a turning operation.     

Pulse electroplating of copper film: a study of process and microstructure

Copper films with high density of twin boundaries are known for high mechanical strength with little tradeoff in electrical conductivity. To achieve such a high density, twin lamellae and spacing will be on the nanoscale. In the current study, 10 microm copper films were prepared by pulse electrodeposition with different applied pulse peak current densities and pulse on-times. It was found that the deposits microstructure was dependent on the parameters of pulse plating. Higher energy pulses caused stronger self-annealing effect on grain recrystallization and growth, thus leading to enhanced fiber textures, while lower energy pulses gave rise to more random microstructure in the deposits and rougher surface topography. However in the extremes of pulse currents we applied, the twin densities were not as high as those resulted from the medium or relatively high pulse currents. The highest amount of nanoscale twinning was found to form from a proper degree of self-annealing induced grain structure evolution. The driving force behind the self-annealing is discussed.     

Experiences with applying a genetic algorithm to determine an information systems architecture

While determining information systems architectures (ISA), business systems planning (BSP) is a well-known method to join processes and data classes to subsystems. BSP matrices have generally been rearranged without describing the underlying methods. Meanwhile, various techniques have been developed for solving the ISA problem. Since exact optimization methods often fail to provide results for large ISA problems, different heuristics have been applied. A new heuristic for solving the ISA problem is the application of genetic algorithms (GA). This paper examines the application of a simple GA to the ISA problem and compares the results of applying the GA with those obtained by exact methods.     

A cellular concrete material used for thorough cleaning of wastewater generated in electroplating process

Heavy metals are of special concern because of their toxicity and negative impact on living organisms. An active porous material for adsorption of heavy metals from aqueous solutions has been manufactured. The material is a sort of cellular concrete with some iron containing industrial dust as an additive. The dust is a result of cleaning of metal elements in the mining machinery production process. Several adsorbents were manufactured. For the adsorbents, the kinetics of batch process of removal of Cu, Zn, Cr and Ni ions from aqueous solutions has been investigated. Laboratory tests of the sorption material were promising. The process is quick; within several minutes the material uptakes over 70% of metal contained in the solution. A trial of continuous treatment of effluents from electroplating facility has been conducted in industry. The employed material demonstrated high cleaning ability firmly binding Cu, Zn, Cr and Ni ions. A sulfuric acid solution of pH value corresponding to the “acid rain”, leached only insignificant amounts of these metals.     

Fast algorithm to determine optical properties of a turbid medium from time-resolved measurements

After analytical expressions for the time-resolved reflectance are introduced from the diffusion approximation under the three most commonly used boundary conditions, a novel algorithm is demonstrated for determining the reduced scattering and the absorption coefficients from time-resolved reflectance (or backscatter) measurements at two positions on the surface of biotissue. The algorithm is straightforward and fast and involves only some simple mathematical operations, avoiding complicated iterative nonlinear fitting to the time-resolved curve. The derived reduced scattering coefficient is not affected by whatever boundary condition is applied. The algorithm was verified with time-resolved data from the Monte Carlo model. Both a semi-infinite medium and a turbid slab medium were tested. In contrast to the nonlinear fitting method, this algorithm allows both the scattering and the absorption coefficients to be determined to a high accuracy.     

Simple algorithm to determine the near-edge smoke boundaries with scanning lidar

We propose a modified algorithm for the gradient method to determine the near-edge smoke plume boundaries using backscatter signals of a scanning lidar. The running derivative of the ratio of the signal standard deviation (STD) to the accumulated sum of the STD is calculated, and the location of the global maximum of this function is found. No empirical criteria are required to determine smoke boundaries; thus the algorithm can be used without a priori selection of threshold values. The modified gradient method is not sensitive to the signal random noise at the far end of the lidar measurement range. Experimental data obtained with the Fire Sciences Laboratory lidar during routine prescribed fires in Montana were used to test the algorithm. Analysis results are presented that demonstrate the robustness of this algorithm.     

Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm

This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of minimizing the total tardiness of jobs. To tackle this problem, it is suggested that a procedure based on a greedy algorithm is employed that successively iterates over an increasing number of candidate solutions. The computational experiments carried out show this algorithm outperforms the best existing one for the problem under consideration. In addition, out some tests are carried out to analyse the efficiency of the adopted design.     

Using response surface design to determine the optimal parameters of genetic algorithm and a case study

Genetic algorithms (GAs) are efficient stochastic search techniques for approximating optimal solutions within complex search spaces and used widely to solve NP-hard problems. Genetic algorithm includes a number of parameters whose different levels strictly affect the performance of the algorithm. The general approach to determine the appropriate parameter combination of GA depends on too many trials of different combinations, and the best one of them that produces good results is selected for the programme, which would be used for problem solving. A few researchers studied on the parameter optimisation of GA. In this paper, response surface-dependent parameter optimisation is proposed to determine the optimal parameters of GA. Results are tested for benchmark problems that are most common in mixed-model assembly line balancing problems of type-I.     

Fatigue as a process of cyclic brittle microfracture

While fatigue crack growth in vacuum may occur by slip alone, environmental fatigue including crack growth in air is strongly influenced by crack‐tip surface chemistry that adversely affects ductility. Cumulative diffusion, combined with adsorption and chemisorption in the loading half‐cycle may promote instantaneous crack extension by brittle microfracture (BMF). Unlike slip, the BMF component will be sensitive to parameters that affect near‐tip stresses, such as load history and constraint. BMF dominates near‐threshold environmental fatigue. Being a surface phenomenon, it loses its significance with increasing growth rate, as slip‐driven crack extension gains momentum and growth becomes less sensitive to environment. The BMF model provides for the first time, a scientific rationale for the residual stress effect as well as the related connection between stress–strain hysteresis and load‐sequence sensitivity of metal fatigue including notch response. Experimental evidence obtained on a variety of materials under different loading conditions in air and vacuum appears to support the proposed model and its implications.     

A partition experimental design for a sequential process with a large number of variables

Statistically designed experiments provide a systematic approach to study and analyze the effects of multiple factors on process performance. In order to improve the performance across an organization, one must investigate multiple processes from supplier to customer. Partition experimental designs provide a design to model several sequential processes simultaneously. The partition design provides the investigator with an efficient design where potential cost and time constraints exist. That is, partition designs are applicable when runs are costly and a large number of variables exist in the serial process. In this paper, we present the application of partition designs using 10 factors in a simulated case study. The design and analysis procedures are discussed, as well as the benefits. Copyright © 2006 John Wiley & Sons, Ltd.     

Using the pulsed nature of staircase cyclic voltammetry to determine interfacial electron-transfer rates of adsorbed species

Staircase cyclic voltammetry (SCV) is the digital counterpart of analog cyclic voltammetry (CV). However, when the redox-active species is adsorbed at the electrode surface, the voltammetric peak shapes (width, height, area, and to a lesser extent the reduction potentials) obtained with SCV can be very different from those of CV, even when small potential steps are used. Like analog CV, SCV provides a straightforward method to estimate and subtract the background and charging currents from the desired Faradaic current, while the pulsed nature of SCV provides the time-dependent decay of the Faradaic current, similar to chronoamperometry. Thus, electron-transfer rate constants can be directly measured as a function of applied potential, and no a priori model is required. An SCV equivalent of the square wave "quasi-reversible maximum" of observed peak height versus sampling moment and step size is predicted. The SCV response can only become independent of potential step size and similar to CV at high scan rates (ν > 10 k(0)E(step)), if the current is sampled at half the step interval. The applicability of SCV to studies of redox centers in proteins is illustrated for the two-electron oxidation/reduction of yeast cytochrome c peroxidase, adsorbed at a pyrolytic graphite edge-plane electrode.     

A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

It is shown that the job-shop problem with two machines and a fixed number ofk jobs with makespan criterionJ2¦n=k¦C ^max is polynomially solvable. Sotskov and Shakhlevich (1993) have shown that problemJ3¦n=3¦C _maxisNP-hard. Furthermore it is well known that J¦n=2¦C _maxin polynomially solvable. Thus, our result settles the remaining open question concerning the complexity status of job-shop problems with fixed numbers of jobs and machines.Supported by Deutsche Forschungsgemeinschaft, Project Jop-TAG