TY - JOUR TI - Electro-Discharge Consolidation of Atomized High Strength Aluminum Powders AU - Qiu, J. AU - Shibata, T. AU - Rock, C. AU - Okazaki, K. T2 - Materials Transactions, JIM AB - Electro-discharge consolidation (EDC) was carried out for atomized Al-based alloy powders produced at YKK. Input energies of 2.5 to 3.8 kJ/g produced compacts of 88 to 99% in theoretical density. The densification can be described by a simple relation of Δρ=11.8[ERs⁄(Rs+2)]0.36 in % where Rs is the specimen resistance, and it predominantly depends on input energy, E. A comparison of XRD spectra before and after EDC with respect to the peaks’ position and intensity indicates that no microstructural change occurred. Oxide film removal by EDC was confirmed by TEM observations. Compression tests of EDC compacts at room temperature produced under the present conditions (specimen resistance Rs=9.4–15.8 mΩ) yielded 800 MPa and 24% elongation for true ultimate compressive stress and true compressive strain, respectively. The annealing treatment at 573 K for 1.2 ks raiseds compressive strength by at expense of ductility due to precipitation of solute atoms, indicating that a super-saturated solid solution is maintained in the EDC state. DA - 1997/// PY - 1997/// DO - 10.2320/matertrans1989.38.226 VL - 38 IS - 3 SP - 226-231 J2 - Mater. Trans., JIM LA - en OP - SN - 0916-1821 2432-471X UR - http://dx.doi.org/10.2320/matertrans1989.38.226 DB - Crossref ER - TY - CHAP TI - Production Engineering AU - Uzsoy, R. T2 - McGraw-Hill Encyclopedia of Science and Technology PY - 1997/// ET - 8 PB - McGraw-Hill ER - TY - CONF TI - Decomposition Methods for Scheduling Complex Job Shops AU - Demirkol, E. AU - Uzsoy, R. T2 - INFORMS National Meeting C2 - 1997/10// CY - Atlanta, GA DA - 1997/10// PY - 1997/10// ER - TY - CONF TI - Performance of Decomposition Methods for Complex Workshops Under Multiple Criteria AU - Demirkol, E. AU - Uzsoy, R. T2 - 21st International Conference on Computers and Industrial Engineering C2 - 1997/3// C3 - Proceedings of the 21st International Conference on Computers and Industrial Engineering CY - San Juan, PR DA - 1997/3// PY - 1997/3// ER - TY - JOUR TI - Focusing Maintenance Improvement Efforts in a Wafer Fabrication Facility Operating Under Theory of Constraints AU - Kayton, D. AU - Teyner, T. AU - Schwartz, C. AU - Uzsoy, R. T2 - Production and Inventory Management DA - 1997/// PY - 1997/// IS - Fourth Quarter SP - 51-57 ER - TY - SOUND TI - Dispatching and Maintenance Management in a Wafer Fab Operating Under Theory of Constraints AU - Teyner, T. AU - Uzsoy, R. DA - 1997/1// PY - 1997/1// ER - TY - SOUND TI - Disassembly Configurations and Supply Chain Management for Companies with Product Recovery and Remanufacturing AU - Uzsoy, R. DA - 1997/9// PY - 1997/9// ER - TY - SOUND TI - Supply Chain Management in Electronics Manufacturing with Remanufacturing Capability AU - Uzsoy, R. DA - 1997/11// PY - 1997/11// ER - TY - CONF TI - Spare parts inventory management for semiconductor wafer fabrication facilities AU - Akcali, E. AU - Hamlin, R.D. AU - Teyner, T. AU - Uzsoy, R. AU - Venkatachalam, G. T2 - 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings AB - We consider the problem of managing spare parts inventories in a semiconductor wafer fabrication facility. We study the performance of four different inventory control policies using simulation and mathematical models. Preliminary results show that two of the models yield significant improvements over the current inventory management policy. C2 - 1997/// C3 - 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings (Cat. No.97CH36023) DA - 1997/// PY - 1997/10// DO - 10.1109/issm.1997.664484 PB - IEEE UR - http://dx.doi.org/10.1109/issm.1997.664484 ER - TY - CONF TI - Decomposition procedures for global scheduling of complex job shops AU - Uzsoy, R. AU - Wang, Cheng-Shuo T2 - Twenty First IEEE/CPMT International Electronics Manufacturing Technology Symposium 1997 IEMT Symposium AB - We describe a prototype decomposition procedure which uses global information on shop status to develop improved schedules for wafer fabrication facilities. The system studied contains reentrant product flows, multiple products and both unit capacity and batch machines. Preliminary experiments show that the decomposition procedure yields significantly better schedules in reasonable CPU times. C2 - 1997/// C3 - Twenty First IEEE/CPMT International Electronics Manufacturing Technology Symposium Proceedings 1997 IEMT Symposium DA - 1997/// PY - 1997/10// DO - 10.1109/iemt.1997.626955 PB - IEEE UR - http://dx.doi.org/10.1109/iemt.1997.626955 ER - TY - CONF TI - Production planning for companies with product recovery and remanufacturing capability AU - Uzsoy, R. T2 - 1997 IEEE International Symposium on Electronics and the Environment. ISEE-1997 AB - We present an integrated set of models addressing issues of production planning in supply chains involving product recovery and disassembly. The supply chain models can be used to develop production plans in the short term, or examine the effects of different strategies in the long term. Uncertainty is addressed by using deterministic models to solve a range of different scenarios. We also develop models to determine profitable disassembly configurations for single and multiple products. Results to date are reported and future directions discussed. C2 - 1997/// C3 - Proceedings of the 1997 IEEE International Symposium on Electronics and the Environment. ISEE-1997 DA - 1997/// PY - 1997/5// DO - 10.1109/isee.1997.605342 PB - IEEE UR - http://dx.doi.org/10.1109/isee.1997.605342 ER - TY - JOUR TI - MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE AU - Uzsoy, Reha AU - Yang, Yaoyu T2 - Production and Operations Management AB - We study the problem of scheduling jobs on a single batch processing machine to minimize the total weighted completion time. A batch processing machine is one that can process a number of jobs simultaneously as a batch. The processing time of a batch is given by the processing time of the longest job in the batch. We present a branch and bound algorithm to obtain optimal solutions and develop lower bounds and dominance conditions. We also develop a number of heuristics and evaluate their performance through extensive computational experiments. Results show that two of the heuristics consistently generate high‐quality solutions in modest CPU times. DA - 1997/// PY - 1997/// DO - 10.1111/j.1937-5956.1997.tb00415.x VL - 6 IS - 1 SP - 57-73 SN - 1059-1478 UR - http://dx.doi.org/10.1111/j.1937-5956.1997.tb00415.x ER - TY - JOUR TI - Rescheduling on a Single Machine with Part Type Dependent Setup Times and Due Dates AU - Tamer Unal, Ali AU - Uzsoy, Reha AU - Kiran, Ali S. T2 - Annals of Operations Research DA - 1997/// PY - 1997/// DO - 10.1023/a:1018955111939 VL - 70 SP - 93-113 SN - 0254-5330 UR - http://dx.doi.org/10.1023/a:1018955111939 ER - TY - JOUR TI - A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems AU - Demirkol, Ebru AU - Mehta, Sanjay AU - Uzsoy, Reha T2 - Journal of Heuristics DA - 1997/11// PY - 1997/11// DO - 10.1023/a:1009627429878 VL - 3 IS - 2 SP - 111–137 SN - 1381-1231 UR - http://dx.doi.org/10.1023/a:1009627429878 ER - TY - JOUR TI - Alternative facility layouts for semiconductor wafer fabrication facilities AU - Geiger, C.D. AU - Hase, R. AU - Takoudis, C.G. AU - Uzsoy, R. T2 - IEEE Transactions on Components, Packaging, and Manufacturing Technology: Part C AB - Semiconductor wafer fabrication facilities are widely acknowledged to be among the most complicated industrial systems from a production planning and control point of view. The design of most wafer fabrication facilities has followed the process layout, where similar machines are located together. This feeds to complex, reentrant product flows through the facility. In this paper, we examine the effects on fab cycle time of a number of alternative layouts or machine dedication policies using a process for manufacturing three-dimensional (3-D) complementary metal-oxide-semiconductor (CMOS) devices as a research vehicle. We examine the performance of the layouts under different levels of machine breakdown, utilization, transfer time between stations, and setup times. Results show that cellular layouts, where machines are dedicated to a limited number of process steps, require more machinery but perform well when setup and transfer times are high and machinery is reliable. As machines become more unreliable, the flexibility of the process layouts becomes a major advantage. An interesting result is that the addition of modest amounts of extra capacity at critical workstations can significantly improve the cycle time performance of a fab. DA - 1997/4// PY - 1997/4// DO - 10.1109/3476.622885 VL - 20 IS - 2 SP - 152-163 J2 - IEEE Trans. Comp., Packag., Manufact. Technol. C OP - SN - 1083-4400 UR - http://dx.doi.org/10.1109/3476.622885 DB - Crossref ER - TY - JOUR TI - Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates AU - Chand, Suresh AU - Traub, Rodney AU - Uzsoy, Reha T2 - Annals of Operations Research DA - 1997/4// PY - 1997/4// DO - 10.1023/a:1018961818782 VL - 70 SP - 115–125 SN - 0254-5330 UR - http://dx.doi.org/10.1023/a:1018961818782 KW - scheduling KW - dynamic arrivals KW - heuristics KW - rolling horizon procedure ER - TY - JOUR TI - A Tabu search approach to scheduling an automated wet etch station AU - Geiger, Christopher D. AU - Kempf, Karl G. AU - Uzsoy, Reha T2 - Journal of Manufacturing Systems AB - This paper addresses a production scheduling problem arising at the wet etching process in a semiconductor wafer fabrication facility. Material handling capacity, material processing constraints, and mixed storage policies are considered in formulating the problem as a flow shop sequencing problem with the objective of minimizing makespan (Cmax). Efficient heuristics and a tabu search procedure are developed to generate high-quality solutions in reasonable computational time. Extensive computational experiments evaluating the performance of the heuristics are reported. DA - 1997/1// PY - 1997/1// DO - 10.1016/s0278-6125(97)85674-9 VL - 16 IS - 2 SP - 102-116 J2 - Journal of Manufacturing Systems LA - en OP - SN - 0278-6125 UR - http://dx.doi.org/10.1016/s0278-6125(97)85674-9 DB - Crossref KW - scheduling KW - semiconductor manufacturing KW - heuristics KW - flow Shop KW - robotic workcells ER - TY - JOUR TI - Multiobjective stochastic scheduling of job ready times AU - Stanfield, P.M. AU - King, R.E. AU - Hodgson, T.J. T2 - Annals of Operations Research DA - 1997/// PY - 1997/// DO - 10.1023/A:1018974221508 VL - 70 SP - 221–239 ER - TY - BOOK TI - Fuzzy Mathematics and Optimization AU - Wang, D. AU - Fang, S. DA - 1997/// PY - 1997/// PB - Science Press SN - 7-03-005829-1 ER - TY - JOUR TI - Autonomous mobile robot global motion planning and geometric beacon collection using traversability vectors AU - Janét, J.A. AU - Luo, R.C. AU - Kay, M.G. T2 - IEEE Transactions on Robotics and Automation AB - Approaches in global motion planning (GMP) and geometric beacon collection (for self-localization) using traversability vectors have been developed and implemented in both computer simulation and actual experiments on mobile robots. Both approaches are based on the same simple, modular, and multifunctional traversability vector (t-vector). Through implementation it has been found that t-vectors reduce the computational requirements to detect path obstructions, Euclidean optimal via-points, and geometric beacons, as well as to identify which features are visible to sensors. Environments can be static or dynamic and polygons are permitted to overlap (i.e., intersect or be nested). While the t-vector model does require that polygons be convex, it is a much simpler matter to decompose concave polygons into convex polygon sets than it is to require that polygons not overlap, which is required for many other GMP models. T-vectors also reduce the data size and complexity of standard V-graphs and variations thereof. This paper presents the t-vector model so that the reader can apply it to mobile robot GMP and self-localization. DA - 1997/// PY - 1997/// DO - 10.1109/70.554354 VL - 13 IS - 1 SP - 132-140 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031077257&partnerID=MN8TOARS KW - computational geometry collision detection KW - geometric beacon detection/collection KW - mobile robot KW - motion planning KW - range sensor prediction KW - self-localization ER - TY - CONF TI - Multi-layered fuzzy behavior fusion for reactive control of an autonomous mobile robot AU - Goodridge, Steven G. AU - Kay, Michael G. AU - Luo, Ren C. C2 - 1997/// C3 - IEEE International Conference on Fuzzy Systems DA - 1997/// VL - 1 SP - 579-584 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0030660961&partnerID=MN8TOARS ER - TY - JOUR TI - Dynamic lot size/sequencing policies in a multi-product, single-machine system AU - Hodgson, Thom J. AU - Ge, Gang AU - King, Russell E. AU - Said, Hamdy T2 - IIE Transactions AB - Abstract This paper is concerned with the modeling and analysis of a single-machine, multi-product, integrated production-inventory system. A semi-Markov model is developed that incorporates a state-dependent control system. Control optimization is achieved through the use of Markov-renewal programming. Three- and four-product models are developed. The model(s) are exercised over a range of parameters in order to determine the characteristics of the system, and to identify the structure of the optimal control rules of the system. The result is that one can identify simple basic rules of operation that are near-optimal in a dynamic environment, and that make sense intuitively. DA - 1997/2// PY - 1997/2// DO - 10.1080/07408179708966320 VL - 29 IS - 2 SP - 127-137 J2 - IIE Transactions LA - en OP - SN - 0740-817X 1545-8830 UR - http://dx.doi.org/10.1080/07408179708966320 DB - Crossref ER - TY - CONF TI - An introduction to object-oriented simulation in C++ AU - Joines, Jeffrey A. AU - Roberts, Stephen D. AB - Article Free Access Share on An introduction to object-oriented simulation in C++ Authors: Jeffrey A. Joines Department of Industrial Engineering, Campus Box 7906, North Carolina State University, Raleigh, NC Department of Industrial Engineering, Campus Box 7906, North Carolina State University, Raleigh, NCView Profile , Stephen D. Roberts Department of Industrial Engineering, Campus Box 7906, North Carolina State University, Raleigh, NC Department of Industrial Engineering, Campus Box 7906, North Carolina State University, Raleigh, NCView Profile Authors Info & Claims WSC '97: Proceedings of the 29th conference on Winter simulationDecember 1997Pages 78–85https://doi.org/10.1145/268437.268453Published:01 December 1997Publication History 7citation297DownloadsMetricsTotal Citations7Total Downloads297Last 12 Months13Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF C2 - 1997/// C3 - Proceedings of the 29th conference on Winter simulation - WSC '97 DA - 1997/// DO - 10.1145/268437.268453 PB - ACM Press ER - TY - JOUR TI - Conduct, misconduct, and cargo cult science AU - Wilson, , JR T2 - PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE AB - Article Free Access Share on Conduct, misconduct, and cargo cult science (doctoral colloquium keynote address) Author: James R. Wilson Department of Industrial Engineering, North Carolina State University, Raleigh, North Carolina Department of Industrial Engineering, North Carolina State University, Raleigh, North CarolinaView Profile Authors Info & Claims WSC '97: Proceedings of the 29th conference on Winter simulationDecember 1997 Pages 1405–1413https://doi.org/10.1145/268437.268790Published:01 December 1997Publication History 4citation292DownloadsMetricsTotal Citations4Total Downloads292Last 12 Months17Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF DA - 1997/// PY - 1997/// DO - 10.1145/268437.268790 SP - 1405-1413 ER - TY - CONF TI - A neural network approach to solving convex programming problems AU - Fang, S.-C. AU - Chen, Y.-H. C2 - 1997/// C3 - Joint Conference of Information Sciences: Semiotics, fuzzy logic, soft computing, computer vision, neural computing, genetic algorithm, pattern recognition, evolutionary computing DA - 1997/// VL - 2 SP - 215-218 PB - Durham, NC: Duke University Machine Intelligence & Fuzzy Logic Laboratory ER - TY - JOUR TI - A global-filtering algorithm for linear programming problems with stochastic elements AU - Wang, D. W. AU - Fang, S. C. T2 - IEEE Transactions on Systems, Man, and Cybernetics. Part A, Systems and Humans DA - 1997/// PY - 1997/// VL - 27 IS - 5 SP - 636-645 ER - TY - CONF TI - A fuzzy-control-based quick response reorder scheme for retailing of seasonal apparel AU - Fang, S.-C. AU - Chen, T.-W. AU - Nuttle, H.L.W. AU - King, R. E. C2 - 1997/// C3 - Joint Conference of Information Sciences: Semiotics, fuzzy logic, soft computing, computer vision, neural computing, genetic algorithm, pattern recognition, evolutionary computing DA - 1997/// VL - 2 SP - 300-303 PB - Durham, NC: Duke University Machine Intelligence & Fuzzy Logic Laboratory ER - TY - BOOK TI - Mo hu shu hsueh yu mo hu yiu hua=Fuzzy mathematics and optimization AU - Fang, S. C. AU - Wang, D. C. CN - QA248.5 .F36 1997 DA - 1997/// PY - 1997/// PB - Beijing, China: Ko hsueh chu pan she SN - 7030058291 ER - TY - JOUR TI - Empirical Investigation of the Benefits of Partial Lamarckianism AU - Houck, Christopher R. AU - Joines, Jeffery A. AU - Kay, Michael G. AU - Wilson, James R. T2 - EVOLUTIONARY COMPUTATION AB - Genetic algorithms (GAs) are very efficient at exploring the entire search space; however, they are relatively poor at finding the precise local optimal solution in the region in which the algorithm converges. Hybrid GAs are the combination of improvement procedures, which are good at finding local optima, and GAs. There are two basic strategies for using hybrid GAs. In the first, Lamarckian learning, the genetic representation is updated to match the solution found by the improvement procedure. In the second, Baldwinian learning, improvement procedures are used to change the fitness landscape, but the solution that is found is not encoded back into the genetic string. This paper examines the issue of using partial Lamarckianism (i.e., the updating of the genetic representation for only a percentage of the individuals), as compared to pure Lamarckian and pure Baldwinian learning in hybrid GAs. Multiple instances of five bounded nonlinear problems, the location-allocation problem, and the cell formation problem were used as test problems in an empirical investigation. Neither a pure Lamarckian nor a pure Baldwinian search strategy was found to consistently lead to quicker convergence of the GA to the best known solution for the series of test problems. Based on a minimax criterion (i.e., minimizing the worst case performance across all test problem instances), the 20% and 40% partial Lamarckianism search strategies yielded the best mixture of solution quality and computational efficiency. DA - 1997/// PY - 1997/// DO - 10.1162/evco.1997.5.1.31 VL - 5 IS - 1 SP - 31-60 SN - 1530-9304 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031082512&partnerID=MN8TOARS KW - Lamarckian evolution KW - Baldwin effect KW - local improvement procedures KW - hybrid genetic algorithms ER - TY - JOUR TI - On the entropic regularization method for solving min-max problems with applications AU - Li, XS AU - Fang, SC T2 - MATHEMATICAL METHODS OF OPERATIONS RESEARCH DA - 1997/// PY - 1997/// DO - 10.1007/BF01199466 VL - 46 IS - 1 SP - 119-130 SN - 1432-2994 KW - min-max problem KW - linear and nonlinear programming KW - entropy optimization principles ER - TY - BOOK TI - Entropy optimization and mathematical programming AU - Fang, S. C. AU - Rajasekera, J. R. AU - Tsao, H. S. J. CN - T57.6 .F35 1997 DA - 1997/// PY - 1997/// PB - Boston: Kluwer Academic Publishers SN - 0792399390 ER - TY - JOUR TI - Surface interrogation and machining strip evaluation for 5-axis CNC die and mold machining AU - Lee, YS AU - Ji, H T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH AB - This research is focused on the investigation of robust surface interrogation tools which can support the planning and programming of 5-axis die/mold surface machining. Surface curvature information is evaluated to determine optimal tool orientation for 5-axis machining. A method for calculating machining strip width is proposed for 5-axis cutter path generation. This paper is focused on the development of computational geometry techniques and their application to design, analysis, and manufacturing automation. The proposed planning and programming methodology consists of three phases: (1) surface interrogation; (2) machining strip width evaluation; and (3) optimum tool orientation for 5-axis machining. This proposed research can be used to improve the quality of 5-axis die/mold machining. DA - 1997/1// PY - 1997/1// DO - 10.1080/002075497196064 VL - 35 IS - 1 SP - 225-252 SN - 0020-7543 ER - TY - JOUR TI - Ready-time scheduling with stochastic service times AU - Hodgson, TJ AU - King, RE AU - Stanfield, PM T2 - OPERATIONS RESEARCH AB - A frequently encountered scheduling problem is to determine simultaneously a material and job ready time and production sequence based on customer-specified due dates. Each job has a stochastic production time and a deterministic due date. The ready time is constrained in that the probability that each job will be complete by its due date must meet some minimum level of confidence. The objective in such an instance is to postpone the ready time as late as possible without violating these constraints. The steps and effort necessary to determine the maximum ready time and optimal production sequence, and cases in which this effort may be significantly reduced are presented. The resulting model is applied directly to single-facility and flow-shop production environments. Methods are shown for scheduling in a dynamic environment. DA - 1997/// PY - 1997/// DO - 10.1287/opre.45.5.779 VL - 45 IS - 5 SP - 779-783 SN - 0030-364X ER - TY - JOUR TI - A genetics-based approach for aggregated production planning in a fuzzy environment AU - Wang, DW AU - Fang, SC T2 - IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS AB - Due to the nondeterministic nature of the business environment of a manufacturing enterprise, it is more appropriate to describe the aggregated production planning by using a fuzzy mathematical programming model. In this paper, a genetics-based inexact approach is proposed to imitate the human decision procedure for production planning. Instead of locating one exact optimal solution, the proposed approach finds a family of inexact solutions within an acceptable level by adopting a mutation operator to move along a weighted gradient direction. Then, a decision maker can select a preferred solution by examining a convex combination of the solutions in the family via the human-computer interaction. Our computational experiments illustrate how the enterprise managers can be more satisfied by this new approach than others. DA - 1997/9// PY - 1997/9// DO - 10.1109/3468.618262 VL - 27 IS - 5 SP - 636-645 SN - 1558-2426 ER - TY - JOUR TI - Selective activation of the external oblique musculature during axial torque production AU - Mirka, G. A. AU - Kelaher, D. P. AU - Baker, A. AU - Harrison, A. AU - Davis, J. R. T2 - Clinical Biomechanics (Bristol, Avon) DA - 1997/// PY - 1997/// VL - 12 IS - 3 SP - 172-180 ER - TY - JOUR TI - Estimating and simulating Poisson processes having trends or multiple periodicities AU - Kuhl, ME AU - Wilson, , JR AU - Johnson, MA T2 - IIE TRANSACTIONS AB - We develop and evaluate procedures for estimating and simulating nonhomogeneous Poisson processes having an exponential rate function, where the exponent may include a polynomial component or some trigonometric components or both. Maximum likelihood estimates of the unknown continuous parameters of the rate function are obtained numerically, and the degree of the polynomial rate component is determined by a likelihood ratio test. The experimental performance evaluation for this estimation procedure involves applying the procedure to 100 independent replications of nine selected point processes that possess up to four trigonometric rate components together with a polynomial rate component whose degree ranges from zero to three. On each replication of each process, the fitting procedure is applied to estimate the parameters of the process; and then the corresponding estimates of the rate and mean-value functions are computed over the observation interval. Evaluation of the fitting procedure is based on plotted tolerance bands for the rate and mean-value functions together with summary statistics for the maximum and average absolute estimation errors in these functions computed over the observation interval. The experimental results provide substantial evidence of the numerical stability and usefulness of the fitting procedure in simulation applications. DA - 1997/3// PY - 1997/3// DO - 10.1080/07408179708966327 VL - 29 IS - 3 SP - 201-211 SN - 0740-817X ER - TY - JOUR TI - Admissible tool orientation control of gouging avoidance for 5 axis complex surface machining AU - Lee, YS T2 - COMPUTER-AIDED DESIGN AB - This paper presents a methodology and algorithms of admissible tool orientation control for gouging avoidance in 5-axis machining. A method is proposed to find the admissible tool orientation by considering both local and global surface shapes. A filleted endmill is used in this study for 5-axis machining. Based on the evaluation of local surface shape, a geometry analysis method is developed to first find a feasible tool orientation for gouging avoidance along two orthogonal cutting places. Adjacent geometry is then taken into consideration for detecting possible rear gouging. A localization algorithm is developed for filleted endmills to identify potential rear gouging area. Both the circular approximation, and the detailed gouging checking methods are proposed for rear gouging correction. The techniques presented in this paper can be used to eliminate errors of tool paths as they are generated. Unlike the traditional graphical verification and user-interactive correction of tool path generation, the proposed methodology can be used to automate the planning and programming of cutter path generation for 5-axis machining. DA - 1997/7// PY - 1997/7// DO - 10.1016/S0010-4485(97)00002-X VL - 29 IS - 7 SP - 507-521 SN - 0010-4485 KW - CAD/CAM KW - 5-axis NC machining KW - admissible tool orientation control KW - gouging avoidance KW - sculptured surface machining KW - filleted endmill ER - TY - JOUR TI - A fuzzy expert system model for RF receiver module testing AU - Lu, J.-J. AU - Brinkley, P. AU - Fang, Shu-Cherng T2 - International Journal of Systems Science AB - Abstract An expert system for PCS-1900 radio frequency module test failure diagnostics that incorporates fuzzy logic has been implemented in the Wireless Networks manufacturing facility of Nortel in Research Triangle Park, North Carolina. Since the relations between the results of parametric test measurement and failure modes are neither certain nor definite, it is advantageous to employ fuzzy logic in building a knowledge base system. Instead of providing a definite conclusion that specifies a specific failure mode, this system gives a degree of failure for each mode, indicating the possibility of that mode being faulty. DA - 1997/// PY - 1997/// DO - 10.1080/00207729708929439 VL - 28 IS - 8 SP - 791–798 ER - TY - JOUR TI - A methodology for the reduction of imprecision in the engineering process AU - Giachetti, RE AU - Young, RE AU - Roggatz, A AU - Eversheim, W AU - Perrone, G T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH AB - Engineering design is characterized by a high level of imprecision, vague parameters, and ill-defined relationships. In design, imprecision reduction must occur to arrive at a final product specification. Few design systems exist for adequately representing design imprecision, and formally reducing it to precise values. Fuzzy set theory has considerable potential for addressing the imprecision in design. However, it lacks a formal methodology for system development and operation. One repercussion of this is that imprecision reduction is, at present, implemented in a relatively ad-hoc manner. The main contribution of this paper is to introduce a methodology called precision convergence for making the transition from imprecise goals and requirements to the precise specifications needed to manufacture the product. A hierarchy of fuzzy constraint networks is presented along with a methodology for creating transitional links between different levels of the hierarchy. The solution methodology is illustrated with an example within which an imprecision reduction of 98% is achieved in only three stages of the design process. The imprecision reduction is measured using the coefficient of imprecision, a new measure introduced to quantify imprecision. DA - 1997/7/16/ PY - 1997/7/16/ DO - 10.1016/S0377-2217(96)00290-1 VL - 100 IS - 2 SP - 277-292 SN - 0377-2217 KW - engineering design KW - design KW - decision making KW - constraint processing KW - fuzzy set theory KW - hierarchical modeling KW - concurrent engineering KW - precision convergence KW - coefficient of imprecision ER - TY - JOUR TI - The point-to-point connection problem - analysis and algorithms AU - Natu, M AU - Fang, SC T2 - DISCRETE APPLIED MATHEMATICS AB - The point-to-point connection problem is to find a subset of arcs with minimal total cost connecting a fixed number of source-destination pairs. The problem has many variations for different applications. In this paper, we focus on a case where the source-destination pairs are prematched. We examine the structure of the problem with two source-destination pairs and provide an efficient implementation of a Dijkstra-like algorithm with time complexity O (mn + n 2 log n) . We also provide a dynamic programming algorithm with complexity O (n 11 ) for the case with three source-destination pairs. We conjecture that the same approach can be generalized for p source-destination pairs with complexity O (n 3p + 2 ) where p is fixed. DA - 1997/10/21/ PY - 1997/10/21/ DO - 10.1016/s0166-218x(97)00010-3 VL - 78 IS - 1-3 SP - 207-226 SN - 0166-218X KW - algorithms KW - point-to-point connection problem KW - dynamic programming KW - computational complexity ER - TY - JOUR TI - A parametric representation of fuzzy numbers and their arithmetic operators AU - Giachetti, RE AU - Young, RE T2 - FUZZY SETS AND SYSTEMS AB - Direct implementation of extended arithmetic operators on fuzzy numbers is computationally complex. Implementation of the extension principle is equivalent to solving a nonlinear programming problem. To overcome this difficulty many applications limit the membership functions to certain shapes, usually either triangular fuzzy numbers (TFN) or trapezoidal fuzzy numbers (TrFN). Then calculation of the extended operators can be performed on the parameters defining the fuzzy numbers, thus making the calculations trivial. Unfortunately the TFN shape is not closed under multiplication and division. The result of these operators is a polynomial membership function and the triangular shape only approximates the actual result. The linear approximation can be quite poor and may lead to incorrect results when used in engineering applications. We analyze this problem and propose six parameters which define parameterized fuzzy numbers (PFN), of which TFNs are a special case. We provide the methods for performing fuzzy arithmetic and show that the PFN representation is closed under the arithmetic operations. The new representation in conjunction with the arithmetic operators obeys many of the same arithmetic properties as TFNs. The new method has better accuracy and similar computational speed to using TFNs and appears to have benefits when used in engineering applications. DA - 1997/10/16/ PY - 1997/10/16/ DO - 10.1016/S0165-0114(97)00140-1 VL - 91 IS - 2 SP - 185-202 SN - 0165-0114 KW - fuzzy arithmetic KW - triangular fuzzy numbers KW - membership functions KW - arithmetic approximations ER - TY - JOUR TI - A methodology for optimally designing console panels for use by a single operator AU - Sargent, TA AU - Kay, MG AU - Sargent, RG T2 - HUMAN FACTORS AB - A seven-step methodology is presented to determine a dimensionally correct optimal layout of a console panel for a single operator. This methodology integrates the steps in the layout design process and uses a mathematical optimization model from facility design to obtain the optimal panel layout. A major difference in this methodology from previous work is that the mathematical optimization model incorporates factors that are only partially included in previous mathematical models. In addition, it includes the areas of the panel components as a new factor. This methodology is illustrated by the design of a nuclear power plant console panel. DA - 1997/9// PY - 1997/9// DO - 10.1518/001872097778827052 VL - 39 IS - 3 SP - 389-409 SN - 0018-7208 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0031410945&partnerID=MN8TOARS ER - TY - JOUR TI - A method for the incorporation of parametric uncertainty in the weighted evaluation multi-attribute decision analysis model AU - Lavelle, JP AU - Wilson, , JR AU - Gold, HJ AU - Canada, , JR T2 - COMPUTERS & INDUSTRIAL ENGINEERING AB - We develop an extension of the classic Weighted Evaluation (WE) Multi-Attribute Decision Analysis (MADA) model that allows for uncertainty in the parameters of the model. Uncertainties in attribute importance weights and alternative evaluation ratings are represented by independent uniform, triangular or beta random variables; and an iterative multi-variate integration scheme is used to evaluate the mean, variance and skewness of the resulting Probabilistic Weighted Evaluation (PWE). These moments are used to compute two-term Edgeworth and normal approximations to the distribution of: (a) the PWE for each of several alternatives that are to be analysed separately; or (b) the difference between PWEs for selected alternatives that are to be analysed on a pairwise basis. The proposed methodology is used to compare probabilistically three alternative solutions to the Mexico City Airport Siting Problem of Keeney and Raiffa (Keeney, R. L. and Raiffa, H., Decisions with Multiple Objectives. Wiley, New York, 1976). DA - 1997/9// PY - 1997/9// DO - 10.1016/S0360-8352(97)00012-0 VL - 32 IS - 4 SP - 769-786 SN - 0360-8352 ER - TY - JOUR TI - Perturbing the dual feasible region for solving convex quadratic programs AU - Fang, SC AU - Tsao, HSJ T2 - JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS DA - 1997/7// PY - 1997/7// DO - 10.1023/A:1022655502360 VL - 94 IS - 1 SP - 73-85 SN - 1573-2878 KW - convex quadratic programming KW - duality theory KW - perturbation methods ER - TY - JOUR TI - Linear programming with stochastic elements: An on-line approach AU - Guan, S AU - Fang, SC T2 - COMPUTERS & MATHEMATICS WITH APPLICATIONS AB - In this paper, we study linear programming problems with both the cost and right-hand-side vectors being stochastic. Kalman filtering techniques are integrated into the infeasible-interior-point method to develop an on-line algorithm. We first build a “noisy dynamic model” based on the Newton equation developed in the infeasible-interior-point method. Then, we use Kalman filtering techniques to filter out the noise for a stable direction of movement. Under appropriate assumptions, we show a new result of the limiting property of Kalman filtering in this model and prove that the proposed on-line approach is globally convergent to a “true value solution” in the mode of quadratic mean. DA - 1997/5// PY - 1997/5// DO - 10.1016/S0898-1221(97)00066-7 VL - 33 IS - 9 SP - 61-82 SN - 1873-7668 KW - linear programming KW - infeasible-interior-point method KW - stochastic programming KW - Kalman filter ER - TY - JOUR TI - Analysis of the error in the standard approximation used for multiplication of triangular and trapezoidal fuzzy numbers and the development of a new approximation AU - Giachetti, RE AU - Young, RE T2 - FUZZY SETS AND SYSTEMS AB - Triangular and trapezoidal fuzzy numbers are commonly used in many applications. It is well known that the operators used for the non-linear operations such as multiplication, division, and inverse are approximations to the actual operators. It is also commonly assumed that the error introduced by the approximations is small and acceptable. This paper examines the error of approximation for repeated use of the multiplication operand and shows it can be sufficiently large in simple circumstances to produce erroneous results. The computational complexity of the multiplication operation is analyzed and shown to be sufficiently complex that a computationally simpler approximation is needed. As a consequence, the error produced by the approximation for the multiplication operation is analyzed and a new approximation developed that is accurate for a large range of problems. An error expression is developed for the new approximation that can be used to determine when it is producing unacceptable results. DA - 1997/10/1/ PY - 1997/10/1/ DO - 10.1016/S0165-0114(96)00118-2 VL - 91 IS - 1 SP - 1-13 SN - 0165-0114 KW - fuzzy arithmetic KW - triangular fuzzy numbers KW - trapezoidal fuzzy numbers KW - membership functions KW - computational complexity KW - multiplication KW - product operator KW - multiplication approximation ER - TY - JOUR TI - Alternative manufacturing sequences and tolerance buildup: A point of view and a case study AU - Fathi, Y AU - Mittal, RO AU - Cline, JE AU - Martin, PM T2 - INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH AB - We consider alternative sequences of operations for manufacturing a given part. Within each sequence, we study the relationship between the unit-to-unit variation in the machined dimensions and the resulting variation in one or more critical dimensions (i.e. tolerance buildup). We propose an objective criterion for comparing these sequences from the point of view of their impact on the tolerance buildup at the critical dimensions. This criterion, which we refer to as the 'total expected loss' (TEL), is based on the concept of continuous quality loss function. We use TEL as well as the tolerance cost to compare alternative sequences for manufacturing a specific part, and present the results. DA - 1997/1// PY - 1997/1// DO - 10.1080/002075497196019 VL - 35 IS - 1 SP - 123-136 SN - 0020-7543 ER - TY - JOUR TI - A maximum entropy optimization approach to tandem queues with generalized blocking AU - Mishra, S AU - Fang, SC T2 - PERFORMANCE EVALUATION AB - We study a general blocking scheme for an open tandem queueing network with finite intermediate buffers. The service time at each node as well as interarrival time at the first node is assumed to be exponentially distributed. The interarrival and service time at each intermediate node of the tandem queue, under the general blocking scheme, depend upon three parameters at each node, namely, the maximum number of raw jobs, the upper limit on the number of finished but blocked jobs and the buffer capacity. This three-parameter analysis was introduced by Cheng and Yao (1993), and was shown, using Monte Carlo simulations, to provide good results. Our analysis is also based on this three-parameter approach, but with a different view. We first decompose the tandem queue into a group of two-node subsystems in order to derive a set of equations for the effective interarrival and service time distributions at each node. Each of these two-node subsystems is treated as a finite capacity queueing system with population size constraints. Then we apply the principle of maximum entropy to evaluate different parameters such as the blocking probabilities, starvation probabilities, etc., of each subsystem. We propose a step-by-step algorithm along with its convergence properties. A comparison of numerical results with the simulation results is also discussed. DA - 1997/10// PY - 1997/10// DO - 10.1016/S0166-5316(96)00061-2 VL - 30 IS - 4 SP - 217-241 SN - 0166-5316 KW - queueing networks KW - open tandem queue KW - principle of maximum entropy KW - nonlinear programming KW - kanban blocking KW - general blocking KW - mean queue length distribution ER - TY - JOUR TI - In memoriam: Harold Highland (1917-1997) AU - Schriber, T. J. AU - Wilson, J. R. T2 - OR/MS Today DA - 1997/// PY - 1997/// VL - 24 IS - 6 SP - 55 ER - TY - JOUR TI - A linear approximation model for the parameter design problem AU - Fathi, Y T2 - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH AB - We consider the problem of minimizing the variance of a nonlinear function of several random variables, where the decision variables are the mean values of these random variables. This problem arises in the context of robust design of manufactured products and/or manufacturing processes, where the decision variables are the set points for various design components. A nonlinear programming (NLP) model is developed to obtain approximate solutions for this problem. This model is based on a Taylor series expansion of the given function, up to its linear term. A case study pertaining to the design of a coil spring is discussed, and its corresponding NLP model is developed. Using this model, a non-inferior frontier curve is obtained that shows the trade-off between the minimum mass of the coil spring and the minimum variance of its performance characteristic. Results of applying the model to three other case studies are also presented. DA - 1997/3/16/ PY - 1997/3/16/ DO - 10.1016/S0377-2217(96)00286-X VL - 97 IS - 3 SP - 561-570 SN - 0377-2217 KW - quality KW - modelling KW - nonlinear programming KW - manufacturing ER -