TY - JOUR TI - Detailed phase analysis of a 77 at.%Nb-Al system prepared by low-energy ball milling AU - Rock, C. AU - Okazaki, K. T2 - Nanostructured Materials AB - Elemental powders of Nb (77 at.%) andAl (23 at.%) were alloyed in a low-energy ball mill for 360–1800 ks in hopes of forming a nanocrystalline intermetallic compound, Nb3Al. It was revealed by careful deconvolution of XRD spectra into various peaks of possibly existing phases that the resultant powder is a nanocrystalline multiphase mixture consisting of Nb3Al, Nb2Al, elemental Nb and Al, with their particulate sizes of approximately 5–8 nm, even after 1800 ks milling. The volume fractions of these phases were estimated to be 28.4, 39.5, 30.3 and 1.8 vol.%, respectively. The kinetic energy provided by ball-milling was insufficient to produce a single Nb3Al phase, and even heating to 933 K for 25.2 ks failed the total conversion of a multiphase mixture. DA - 1995/8// PY - 1995/8// DO - 10.1016/0965-9773(95)00282-J VL - 5 IS - 6 SP - 643-656 J2 - Nanostructured Materials LA - en OP - SN - 0965-9773 UR - http://dx.doi.org/10.1016/0965-9773(95)00282-J DB - Crossref ER - TY - JOUR TI - Grain growth kinetics and thermal stability in a nanocrystalline multiphase mixture prepared by low-energy ball milling AU - Rock, C. AU - Okazaki, K. T2 - Nanostructured Materials AB - A multiphase powder mixture consisting of approximately 40 vol.% Nb2Al, 30 vol.% Nb, 28 vol.% Nb3Al and 2 vol.% Al with their crystallite sizes of approximately 5 to 8 nm was subjected in vacuum to elevated temperatures. The anneal at 1373 K for 25.2 ks produced a three phase mixture of Nb, Nb2Al, Al and Nb3Al, their volume fractions being 3.9, 4.8 and 91.3 vol.% and their ultimate paniculate sizes being 8.2, 13.8 and 36.0 nm, respectively. The detailed analysis of isothermal annealing from 973 to 1373 K for 3.6, 10.8 and 25.2 ks revealed complex grain growth kinetics for Nb2Al and Nb3Al phases with an exponent of n = 18 in D = ktn where D is grain size, k the growth constant and t annealing time. The analysis of grain growth data yielded a dual-stage activation energy of 68.2 ± 4 and 91.3 ± 6 kJmol for grain growth in Nb3Al below and above 1173 K, respectively. Likewise, the activation energy for grain growth in Nb2Al was found to be 62.8 ± 2 and 83.9 ± 7 kJmole below and above 1173 K, respectively. DA - 1995/8// PY - 1995/8// DO - 10.1016/0965-9773(95)00278-M VL - 5 IS - 6 SP - 657-671 J2 - Nanostructured Materials LA - en OP - SN - 0965-9773 UR - http://dx.doi.org/10.1016/0965-9773(95)00278-M DB - Crossref ER - TY - CONF TI - Predictable Scheduling: An Approach to Reducing the Effects of Uncertainties on Production Schedules AU - Mehta, S.V. AU - Uzsoy, R. T2 - Fourth Industrial Engineering Research Conference C2 - 1995/5// C3 - Proceedings of the Fourth Industrial Engineering Research Conference CY - Nashville, TN DA - 1995/5// PY - 1995/5// ER - TY - BOOK TI - Cellular Manufacturing: A Systems Engineering Approach A3 - Moodie, C.L. A3 - Uzsoy, R. A3 - Yih, Y. DA - 1995/// PY - 1995/// PB - Taylor and Francis ER - TY - SOUND TI - Decomposition Algorithms for Scheduling Complex Job Shops AU - Ovacik, I.M. AU - Uzsoy, R. DA - 1995/7// PY - 1995/7// ER - TY - SOUND TI - OR/MS Career Opportunities in Engineering Schools AU - Uzsoy, R. DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - Robust Predictive Schedules for a Single Machine AU - Mehta, S.V. AU - Uzsoy, R. T2 - INFORMS International Meeting C2 - 1995/6// CY - Singapore DA - 1995/6// PY - 1995/6// ER - TY - CONF TI - Alternative Layouts for Semiconductor Wafer Fabrication Facilities AU - Chen, S. AU - Hase, R. AU - Takoudis, C.G. AU - Uzsoy, R. T2 - NSF Grantees Conference C2 - 1995/1// C3 - Proceedings of the NSF Grantees Conference CY - La Jolla, CA DA - 1995/1// PY - 1995/1// ER - TY - CONF TI - Decomposition Methods for Scheduling Large Complex Shops AU - Ovacik, I.M. AU - Uzsoy, R. T2 - Fourth Industrial Engineering Research Conference C2 - 1995/5// C3 - Proceedings of the Fourth Industrial Engineering Research Conference CY - Nashville, TN DA - 1995/5// PY - 1995/5// ER - TY - CONF TI - Assessing the Quality of Production Schedules AU - Gary, K. AU - Kempf, K. AU - Smith, S. AU - Uzsoy, R. T2 - Intelligent Scheduling Systems Symposium A2 - Scherer, W. A2 - Brown, D. C2 - 1995/11// C3 - Intelligent Scheduling Systems DA - 1995/11// PY - 1992/11// SP - 148–164 PB - Kluwer Academic Publishing ER - TY - CONF TI - Decomposition Methods for Scheduling Problems AU - Uzsoy, R. AU - Ovacik, I.M. T2 - INFORMS National Meeting C2 - 1995/10// CY - New Orleans, LA DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - A Computational Comparison of Shifting Bottleneck Procedures AU - Demirkol, E. AU - Mehta, S.V. AU - Uzsoy, R. T2 - INFORMS National Meeting C2 - 1995/10// CY - New Orleans, LA DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - Predictable Scheduling to Reduce the Effects of Disruptions on Production Schedules AU - Mehta, S.V. AU - Uzsoy, R. T2 - INFORMS National Meeting C2 - 1995/10// CY - New Orleans, LA DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - A Tabu Search Approach to Scheduling Automated Wet Etch Stations AU - Geiger, C.D. AU - Kempf, K. AU - Uzsoy, R. T2 - INFORMS National Meeting C2 - 1995/10// CY - New Orleans, LA DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - Identification of Forecast Horizons in Single Machine Dynamic Scheduling Problems AU - Traub, R. AU - Chand, S. AU - Uzsoy, R. T2 - INFORMS National Meeting C2 - 1995/10// CY - New Orleans, LA DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - An Iterative Heuristic for Single Machine Dynamic Total Completion Time Problems AU - Chand, S. AU - Traub, R. AU - Uzsoy, R. T2 - INFORMS National Meeting C2 - 1995/10// CY - New Orleans, LA DA - 1995/10// PY - 1995/10// ER - TY - CONF TI - A Computational Comparison of Shifting Bottleneck Procedures AU - Demirkol, E. AU - Mehta, S.V. AU - Uzsoy, R. T2 - Midwest Manufacturing and Logistics Roundtable C2 - 1995/12// CY - University of Iowa, Iowa City, IA DA - 1995/12// PY - 1995/12// ER - TY - CONF TI - Decomposition Algorithms for Scheduling Complex Job Shops AU - Ovacik, I.M. AU - Uzsoy, R. T2 - NSF Grantees Conference C2 - 1995/1// C3 - Proceedings of the NSF Grantees Conference CY - La Jolla, CA DA - 1995/1// PY - 1995/1// ER - TY - CONF TI - Alternative facility layouts for semiconductor wafer fabrication facilities AU - Hase, R. AU - Uzsoy, R. AU - Takoudis, C.G. T2 - Seventeenth IEEE/CPMT International Electronics Manufacturing Technology Symposium. 'Manufacturing Technologies - Present and Future' AB - Examines the performance of several different cellular and functional layouts using simulation models of the different facility designs. The performance measure of interest is the mean time in system or cycle time of lots. Our results show that the presence of unreliable machinery causes the performance of cellular layouts to deteriorate, while the presence of significant setup times improves their performance relative to other layouts. The results also indicate that a very modest amount of additional capacity at critical workcenters results in significant improvements in the performance of functional layouts. C2 - 1995/// C3 - Seventeenth IEEE/CPMT International Electronics Manufacturing Technology Symposium. 'Manufacturing Technologies - Present and Future' DA - 1995/// PY - 1995/10// DO - 10.1109/iemt.1995.526191 PB - IEEE UR - http://dx.doi.org/10.1109/iemt.1995.526191 ER - TY - CONF TI - Decomposition algorithms for scheduling semiconductor testing facilities AU - Demirkol, E. AU - Uzsoy, R. AU - Ovacik, I.M. T2 - Seventeenth IEEE/CPMT International Electronics Manufacturing Technology Symposium. 'Manufacturing Technologies - Present and Future' AB - The research described in this paper began in 1988 and is directed at developing effective computerized scheduling procedures for a semiconductor testing facility. To this end we first give a brief overview of the testing process and management goals. We then discuss the performance of a series of different scheduling techniques for this problem, beginning with local dispatching rules that use very limited information through more complex dispatching procedures incorporating local optimization and look-ahead capabilities, culminating in a series of decomposition procedures that take a global view of the test area while making scheduling decisions. Our computational experiments indicate that exploiting the real-time factory status information available in existing factory automation systems can result in significant improvements in shop performance. We conclude the paper with a summary and a discussion of future research directions. C2 - 1995/// C3 - Seventeenth IEEE/CPMT International Electronics Manufacturing Technology Symposium. 'Manufacturing Technologies - Present and Future' DA - 1995/// PY - 1995/10// DO - 10.1109/iemt.1995.526115 PB - IEEE UR - http://dx.doi.org/10.1109/iemt.1995.526115 ER - TY - CONF TI - Production planning for companies with remanufacturing capability AU - Clegg, A.J. AU - Williams, D.J. AU - Uzsoy, R. T2 - 1995 IEEE International Symposium on Electronics and the Environment ISEE (Cat. No.95CH35718) AB - While much work is in progress on developing environmentally benign products and processes, there has been little work to date on how recycling and remanufacturing may affect companies' operations management policies. In this paper we present linear programming models of production systems with remanufacturing capability. The models can be used to examine the effects of different cost structures on the long-term viability of remanufacturing operations,as well as short-term operations management issues. Work is in progress on applying these models to a telephone remanufacturing operation. C2 - 1995/// C3 - Proceedings of the 1995 IEEE International Symposium on Electronics and the Environment ISEE (Cat. No.95CH35718) DA - 1995/// PY - 1995/5// DO - 10.1109/isee.1995.514973 PB - IEEE UR - http://dx.doi.org/10.1109/isee.1995.514973 ER - TY - ER - TY - ER - TY - JOUR TI - Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times AU - Ovacik, I. M. AU - Uzsoy, R. T2 - International Journal of Production Research AB - SUMMARY We present a family of rolling horizon heuristics for minimizing maximum lateness on parallel identical machines in the presence of sequence dependent setup times and dynamic job arrivals. This problem arises as a subproblem in a decomposition procedure for more complex job shop scheduling problems. The procedures solve a series of single machine subproblems to optimality and implement only part of the solution. Extensive computational experiments show that these methods significantly outperform dispatching rules combined with local search methods, both on average and in the worst case. Their performance advantage is particularly pronounced when there is high competition for machine capacity. DA - 1995/11// PY - 1995/11// DO - 10.1080/00207549508904867 VL - 33 IS - 11 SP - 3173-3192 J2 - International Journal of Production Research LA - en OP - SN - 0020-7543 1366-588X UR - http://dx.doi.org/10.1080/00207549508904867 DB - Crossref ER - TY - JOUR TI - Scheduling batch processing machines with incompatible job families AU - Uzsoy, R. T2 - International Journal of Production Research AB - The problem of scheduling a single batch processing machine with incompatible job families was studied, where jobs of different families cannot be processed together in the same batch. First static problems where all jobs are available simultaneously were considered and showed that for a regular performance measure there will be no unnecessary partial batches. This allowed us to develop efficient optimal algorithms to minimize makespan (Cmax), maximum lateness (Lmax) and total weighted completion time and apply some of these results to problems with parallel identical batch processing machines. Then problems withdynamic job arrivals were considered and an efficient optimal algorithm for minimizing Cmax and several heuristics to minimize Lmax were provided. Computational experiments showed that the heuristics developed for the latter problem consistently improve on dispatching solutions in very reasonable CPU times. DA - 1995/10// PY - 1995/10// DO - 10.1080/00207549508904839 VL - 33 IS - 10 SP - 2685-2708 J2 - International Journal of Production Research LA - en OP - SN - 0020-7543 1366-588X UR - http://dx.doi.org/10.1080/00207549508904839 DB - Crossref ER - TY - JOUR TI - Scheduling and order release in a single-stage production system AU - Ashby, James R. AU - Uzsoy, Reha T2 - Journal of Manufacturing Systems AB - We develop a set of scheduling heuristics that integrate order release, group scheduling, and order sequencing for a make-to-order manufacturing facility organized into group technology cells. The procedures take into account both order due dates and sequence-dependent setup times. Simulation experiments are used to compare the performance of the procedures to current practice. Results show that the new scheduling policies, which consider setup times as well as due dates in both order release and job sequencing decisions, substantially improve due date performance and show that both order release policies and dispatching rules have significant effects on system performance. DA - 1995/1// PY - 1995/1// DO - 10.1016/0278-6125(95)98881-6 VL - 14 IS - 4 SP - 290-306 J2 - Journal of Manufacturing Systems LA - en OP - SN - 0278-6125 UR - http://dx.doi.org/10.1016/0278-6125(95)98881-6 DB - Crossref KW - LOADING AND SCHEDULING KW - PRODUCTION CONTROL ER - TY - JOUR TI - A comprehensive review of manufacturing cell design AU - Joines, J.A. AU - King, R.E. AU - Culbreth, C.T. T2 - International Journal of Flexible Automation and Integrated Manufacturing DA - 1995/// PY - 1995/// VL - 3 IS - 3-4 SP - 225–264 ER - TY - JOUR TI - Design of conventional and tandem AGV systems in an object-oriented simulation modeling environment AU - Kim, K.S. AU - King, R.E. T2 - IE Interfaces DA - 1995/// PY - 1995/// VL - 8 IS - 1 ER - TY - JOUR TI - Decision Surface Modeling of Apparel Retail Operations using Neural Network Technology AU - Wu, P.T. AU - Fang, S. AU - King, R.E. AU - Nuttle, H.L.W. T2 - International Journal of Operations and Quantitative Management DA - 1995/// PY - 1995/// VL - 1 SP - 33 – 47 ER - TY - JOUR TI - An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions AU - Tsao, H. -S. Jacob AU - Fang, Shu-Cherng T2 - Zeitschrift für Operations Research AB - This paper proposes an unconstrained dual approach and an efficient algorithm for solving Karmarkar-type linear programming problems. Conventional barrier functions are incorporated as a perturbation term in the derivation of the associated duality theory. An optimal solution of the original linear program can be obtained by solving a sequence of unconstrained concave programs, or be approximated by solving one such dual program with a sufficiently small perturbation parameter. A globally convergent curved-search algorithm with a quadratic rate of convergence is designed for this purpose. Based on our testing results, we find that the computational procedure is very efficient and can be a viable approach for solving linear programming problems. DA - 1995/10// PY - 1995/10// DO - 10.1007/bf01432508 VL - 42 IS - 3 SP - 325–343 SN - 0340-9422 1432-5217 UR - http://dx.doi.org/10.1007/bf01432508 ER - TY - JOUR TI - Implementation of an inexact approach to solving linear semi-infinite programming problems AU - Lin, Chih-Jen AU - Yang, Eugene K. AU - Fang, Shu-Cherng AU - Wu, Soon-Yi T2 - Journal of Computational and Applied Mathematics AB - In this paper, we implement an extended version of the inexact approach proposed by Fang and Wu (1994) for solving linear semi-infinite programming problems. Some interesting numerical results are reported. The results confirm that the inexact approach is indeed more efficient and more robust than the exact approach. DA - 1995/7// PY - 1995/7// DO - 10.1016/0377-0427(94)00051-2 VL - 61 IS - 1 SP - 87-103 J2 - Journal of Computational and Applied Mathematics LA - en OP - SN - 0377-0427 UR - http://dx.doi.org/10.1016/0377-0427(94)00051-2 DB - Crossref KW - SEMIINFINITE PROGRAMMING KW - LINEAR PROGRAMMING KW - ENTROPY OPTIMIZATION ER - TY - JOUR TI - Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems AU - Fang, S. C. AU - Tsao, H.-S. J. T2 - Transportation Science AB - Many transportation problems can be formulated as a linearly-constrained convex programming problem whose objective function consists of entropy functions and other cost-related terms. In this paper, we propose an unconstrained convex programming dual approach to solving these problems. In particular, we focus on a class of linearly-constrained entropy maximization problem with quadratic cost, study its Lagrangian dual, and provide a globally convergent algorithm with a quadratic rate of convergence. The theory and algorithm can be readily applied to the trip distribution problem with quadratic cost and many other entropy-based formulations, including the conventional trip distribution problem with linear cost, the entropy-based modal split model, and the decomposed problems of the combined problem of trip distribution and assignment. The efficiency and the robustness of this approach are confirmed by our computational experience. DA - 1995/11// PY - 1995/11// DO - 10.1287/trsc.29.4.353 VL - 29 IS - 4 SP - 353-365 J2 - Transportation Science LA - en OP - SN - 0041-1655 1526-5447 UR - http://dx.doi.org/10.1287/trsc.29.4.353 DB - Crossref ER - TY - JOUR TI - A New Approach to Tolerance Allocation in Design Cost Analysis AU - Rajasekera, J. R. AU - Fang, S. C. T2 - Engineering Optimization AB - Abstract When components are designed for manufacturing using computer aided design (CAD) tools, computing the minimum manufacturing cost while satisfying other manufacturing constraints becomes a very important issue. It is imperative that computer algorithms be integrated into the design tools in order to compute the costs at various stages of the design process. This paper focuses on the tolerance allocation stage. Assuming the manufacturing cost of a component is an exponential function of the design tolerance, an O(n log2n) algorithm is developed for optimally allocating the total design tolerance among the n constituent components of a product. This algorithm is of most value in CAD and design for manufacturability. KEY WORDS: Tolerance allocationComputer Aided Designdesign for manufacturabilityconvex optimization Additional informationNotes on contributorsJ. R. RAJASEKERA On leave from AT&T Belt Laboratories, Princeton, NJ, USA DA - 1995/8// PY - 1995/8// DO - 10.1080/03052159508941194 VL - 24 IS - 4 SP - 283–291 SN - 0305-215X 1029-0273 UR - http://dx.doi.org/10.1080/03052159508941194 KW - TOLERANCE ALLOCATION KW - COMPUTER AIDED DESIGN KW - DESIGN FOR MANUFACTURABILITY KW - CONVEX OPTIMIZATION ER - TY - JOUR TI - Unconstrained convex programming approach to linear programming AU - Xu, Z. K. AU - Fang, S. C. T2 - Journal of Optimization Theory and Applications DA - 1995/9// PY - 1995/9// DO - 10.1007/bf02192167 VL - 86 IS - 3 SP - 745-752 J2 - J Optim Theory Appl LA - en OP - SN - 0022-3239 1573-2878 UR - http://dx.doi.org/10.1007/bf02192167 DB - Crossref KW - CONVEX PROGRAMS KW - LINEAR PROGRAMS KW - PERTURBATIONS KW - DUALITY ER - TY - JOUR TI - Solving stochastic programming problems via Kalman filter and affine scaling AU - Puthenpura, Sarat AU - Sinha, Lakshman AU - Fang, Shu-Cherng AU - Saigal, Romesh T2 - European Journal of Operational Research 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 - 1995/6// PY - 1995/6// DO - 10.1016/0377-2217(94)00250-g VL - 83 IS - 3 SP - 503-513 J2 - European Journal of Operational Research LA - en OP - SN - 0377-2217 UR - http://dx.doi.org/10.1016/0377-2217(94)00250-g DB - Crossref ER - TY - JOUR TI - On the point-to-point connection problem AU - Natu, Madan AU - Fang, Shu-Cherng T2 - Information Processing Letters AB - A Dijkstra-like algorithm for solving the point-to-point connection problem on a finite directed network is presented. For this problem we find a subset of arcs with minimal total length connecting a fixed number of source-destination pairs. The problem has many variations for different applications. We focus on a case where two source-destination pairs are prematched and show that the time complexity of the algorithm is O(n4). DA - 1995/3// PY - 1995/3// DO - 10.1016/0020-0190(94)00216-l VL - 53 IS - 6 SP - 333-336 J2 - Information Processing Letters LA - en OP - SN - 0020-0190 UR - http://dx.doi.org/10.1016/0020-0190(94)00216-l DB - Crossref KW - ALGORITHMS KW - POINT-TO-POINT CONNECTION PROBLEM KW - DYNAMIC PROGRAMMING KW - COMPUTATIONAL COMPLEXITY ER - TY - JOUR TI - A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming AU - Sheu, R.-L. AU - Wu, S.-Y. AU - Fang, S.-C. T2 - Computers & Mathematics with Applications AB - In this paper, we design an algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming. The proposed algorithm enjoys the advantages of having “multiple inexactness” and “warm start” for computational efficiency. A convergence proof is included. DA - 1995/4// PY - 1995/4// DO - 10.1016/0898-1221(95)00025-t VL - 29 IS - 8 SP - 7-18 J2 - Computers & Mathematics with Applications LA - en OP - SN - 0898-1221 UR - http://dx.doi.org/10.1016/0898-1221(95)00025-t DB - Crossref KW - SEMIINFINITE LINEAR PROGRAMMING KW - PRIMAL-DUAL METHOD KW - INFEASIBLE-INTERIOR-POINT METHOD ER - TY - JOUR TI - Entropy Optimization Models with Convex Constraints AU - Fang, S.C. AU - Rajasekera, J.R. T2 - Information and Computation AB - In this paper, we study the minimum cross-entropy optimization problem subject to a general class of convex constraints. Using a simple geometric inequality and the conjugate inequality we demonstrate how to directly construct a "partial" geometric dual program which allows us to apply the dual perturbation method to derive the strong duality theorem and a dual-to-primal conversion formula. This approach generalizes the previous results of linearly, quadratically, and entropically constrained cross-entropy optimization problems and provides a platform for using general purpose optimizers to generate ϵ-optimal solution pair to the problem. DA - 1995/2// PY - 1995/2// DO - 10.1006/inco.1995.1022 VL - 116 IS - 2 SP - 304-311 J2 - Information and Computation LA - en OP - SN - 0890-5401 UR - http://dx.doi.org/10.1006/inco.1995.1022 DB - Crossref ER - TY - JOUR TI - Implementation and utilization of a decentralized storage system: Costing model AU - Sargent, T.A. AU - Kay, M.G. T2 - International Journal of Operations and Production Management AB - Companies using just‐in‐time principles are currently moving from centralized to decentralized storage areas. A question that needs to be addressed is whether this move is cost efficient. Presents a costing model which can be used to determine if further consideration should be given to decentralized storage in a facility currently utilizing centralized storage. Evaluates whether the savings in material handling flow costs associated with moving from centralized to decentralized storage outweighs the additional costs associated with implementing and utilizing decentralized storage for a designated period of time. Through the process of solving the cost model, a new layout will be created for the decentralized storage system. The layout includes the placement of the additional material storage and receipt areas as well as the rearrangement of the other departments in the facility. DA - 1995/// PY - 1995/// DO - 10.1108/EUM0000000003958 VL - 15 IS - 9 SP - 210-219 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-3543050090&partnerID=MN8TOARS KW - costing KW - decentralization KW - modelling KW - storage ER - TY - CONF TI - Essential visibility graph: an approach to global motion planning for autonomous mobile robots AU - Janet, Jason A. AU - Luo, Ren C. AU - Kay, Michael G. AB - An approach to global motion planning for autonomous mobile robots has been developed on the basis of traversability vectors (t-vectors). Through the overall course of this research it was found that t-vectors provide a utility, efficiency and mathematical stability for collision detection and visibility that cannot be matched by commonly used algebraic approaches in static and dynamic environments. This paper will show that t-vectors also impact global motion planning by identifying redundancies in visibility graphs (V-graphs) and expediting their construction. The result of eliminating redundant path segments is a streamlined version of the V-graph called the essential visibility graph (EVG). This paper will also show that the EVG offers a significant reduction in data storage requirements and complexity. C2 - 1995/// C3 - Proceedings - IEEE International Conference on Robotics and Automation DA - 1995/// DO - 10.1109/ROBOT.1995.526023 VL - 2 SP - 1958-1963 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0029178169&partnerID=MN8TOARS ER - TY - CONF TI - Evaluation of AGV routing strategies using hierarchical simulation AU - Seifert, Ralf W. AU - Kay, Michael G. C2 - 1995/// C3 - Winter Simulation Conference Proceedings DA - 1995/// SP - 850-856 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0029504766&partnerID=MN8TOARS ER - TY - CONF TI - Autonomous mobile robot self-referencing with sensor windows and neural networks AU - Janet, Jason A. AU - Gutierrez-Osuna, Ricardo AU - Kay, Michael G. AU - Luo, Ren C. C2 - 1995/// C3 - IECON Proceedings (Industrial Electronics Conference) DA - 1995/// VL - 2 SP - 1124-1129 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-0029541847&partnerID=MN8TOARS ER - TY - JOUR TI - AgvTalk: An object-oriented simulator for AGV systems AU - King, Russell E. AU - Kim, Kyung Sup T2 - Computers & Industrial Engineering AB - In this paper, AgvTalk, an object-oriented simulation tool for the design and analysis of AGV system configuration and control is presented. Smalltalk-80 is used as an implementation language in AgvTalk. AgvTalk includes 25 object classes and more than 300 object methods in its library. Compared to general purpose simulation languages, AgvTalk provides several important benefits. First, the hierarchical features and modularity create possibilities for the extension and reuse of simulation object components. This extensibility and reusability provide more flexible modeling capabilities for simulation of many alternative AGV systems. Second, detailed behavior of each object in the AGV system can be modeled easily and exactly because there are no limiting modeling constructs. Third, AgvTalk provides a user-friendly simulation modeling environment through the MVC-triad of Smalltalk-80. This paper also presents a one-to-one comparison of modeling features between AgvTalk with traditional simulation languages. DA - 1995/7// PY - 1995/7// DO - 10.1016/0360-8352(94)00210-e VL - 28 IS - 3 SP - 575-592 J2 - Computers & Industrial Engineering LA - en OP - SN - 0360-8352 UR - http://dx.doi.org/10.1016/0360-8352(94)00210-e DB - Crossref ER - TY - JOUR TI - Guided Neural Network Learning Using a Fuzzy Controller, with Applications to Textile Spinning AU - Wu, P. AU - Fang, S-C. AU - Nuttle, H.L.W. AU - Wilson, J.R. AU - King, R.E. T2 - International Transactions in Operational Research AB - We apply neural networks to build a metamodel of the relation between key input parameters and output performance measures of a simulated textile spinning plant. We investigate two different neural network estimation algorithms, namely back‐propagation and an algorithm incorporating a fuzzy controller for the learning rate. According to our experience, both algorithms are capable of providing high‐quality predictions. In addition, results obtained using a fuzzy controller for the learning rate suggest a significant potential for speeding up the training process. DA - 1995/7// PY - 1995/7// DO - 10.1111/j.1475-3995.1995.tb00020.x VL - 2 IS - 3 SP - 259-272 J2 - Int Trans Operational Res LA - en OP - SN - 0969-6016 1475-3995 UR - http://dx.doi.org/10.1111/j.1475-3995.1995.tb00020.x DB - Crossref ER - TY - RPRT TI - The effective use of local improvement procedures in conjunction with genetic algorithms AU - Houck, C AU - Joines, J AU - Kay, M A3 - Technical Report NCSU-IE Technical Report 95, North Carolina State University DA - 1995/// PY - 1995/// PB - Technical Report NCSU-IE Technical Report 95, North Carolina State University ER - TY - JOUR TI - The Genetic Algorithm Optimization Toolbox (GAOT) AU - Houck, Christopher R AU - Joines, Jeffery A AU - Kay, Michael G T2 - North Carolina State University, Department of Industrial Engineering, NCSU-IE Technical Report DA - 1995/// PY - 1995/// SP - 95-09 ER - TY - JOUR TI - Finding It On The Internet John Wiley and Sons, Inc., New York, 1994, 302 pp. ISBN 0-471-03857-1. (Paperback). List: $19.95. AU - Joines, Jeffrey A. T2 - The Engineering Economist DA - 1995/1// PY - 1995/1// DO - 10.1080/00137919508903156 VL - 40 IS - 3 SP - 304-306 ER - TY - RPRT TI - A genetic algorithm for function optimization: a Matlab implementation AU - Houck, C.R. AU - Joines, J.A. AU - Kay, M.G. C6 - 09 DA - 1995/// PY - 1995/// VL - 95 SP - 1-10 M1 - NCSU-IE TR 95 SN - NCSU-IE TR 95 ER - TY - CONF TI - Manufacturing cell design using an integer-based genetic algorithm AU - Joines, J.A. AU - King, R.E. AU - Culbreth, C.T. A2 - ed., R.Schraft A2 - Sullivan, W. A2 - Ahmad, M. A2 - Jacobi, H. C2 - 1995/// C3 - Proceedings of 1995 International Conference on Flexible Automation and Integrated Manufacturing DA - 1995/// SP - 824–835 PB - Begell House, Inc ER - TY - CHAP TI - Automation and robotics in textiles AU - Canada, J. AU - Hodge, G. L. T2 - Automation and robotics in textiles PY - 1995/// PB - Manchester, UK: Textile Institute ER -