Edward P. Fitts Department of Industrial & Systems Engineering

Works Published in 1995

search works

Displaying works 21 - 40 of 50 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

1995 conference paper

Production planning for companies with remanufacturing capability

Proceedings of the 1995 IEEE International Symposium on Electronics and the Environment ISEE (Cat. No.95CH35718). Presented at the 1995 IEEE International Symposium on Electronics and the Environment ISEE (Cat. No.95CH35718).

By: A. Clegg*, D. Williams* & R. Uzsoy*

Event: 1995 IEEE International Symposium on Electronics and the Environment ISEE (Cat. No.95CH35718)

Sources: Crossref, NC State University Libraries
Added: March 26, 2022

1995 article proceedings

Relationships between process fundamentals, facility design, and production control of semiconductor manufacturing systems

(A. G. Sabnis & I. J. Raaijmakers, Eds.).

By: S. Chen*, R. Hase*, K. Mordaunt*, R. Uzsoy* & C. Takoudis*

Ed(s): A. Sabnis & I. Raaijmakers

Event: Microelectronic Manufacturing '95

author keywords: facility design; process fundamentals; production control; silicon selective epitaxial growth; semiconductor manufacturing systems
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: March 6, 2022

1995 chapter book

Measuring the Quality of Manufacturing Schedules

By: K. Gary, R. Uzsoy*, S. Smith* & K. Kempf*

TL;DR: A new approach is suggested which tries to reduce the complexity of the understanding of what constitutes a “good” production schedule and an application to evaluating schedules for a semiconductor wafer fabrication facility. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 6, 2022

1995 journal article

Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times

International Journal of Production Research, 33(11), 3173–3192.

By: I. Ovacik* & R. Uzsoy*

TL;DR: This work presents 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 that significantly outperform dispatching rules combined with local search methods. (via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: March 6, 2022

1995 journal article

Scheduling batch processing machines with incompatible job families

International Journal of Production Research, 33(10), 2685–2708.

By: R. Uzsoy*

TL;DR: 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 and an efficient optimal algorithm for minimizing Cmax and several heuristics to minimize Lmax were provided. (via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: March 6, 2022

1995 journal article

Scheduling and order release in a single-stage production system

Journal of Manufacturing Systems, 14(4), 290–306.

By: J. Ashby* & R. Uzsoy*

author keywords: LOADING AND SCHEDULING; PRODUCTION CONTROL
Sources: Crossref, NC State University Libraries
Added: March 6, 2022

1995 journal article

A comprehensive review of manufacturing cell design

International Journal of Flexible Automation and Integrated Manufacturing, 3(3-4), 225–264.

By: J. Joines, R. King & C. Culbreth

Source: NC State University Libraries
Added: December 26, 2021

1995 journal article

Design of conventional and tandem AGV systems in an object-oriented simulation modeling environment

IE Interfaces, 8(1).

By: K. Kim & R. King

Source: NC State University Libraries
Added: December 26, 2021

1995 journal article

Decision Surface Modeling of Apparel Retail Operations using Neural Network Technology

International Journal of Operations and Quantitative Management, 1, 33–47.

By: P. Wu, S. Fang, R. King & H. Nuttle

Source: NC State University Libraries
Added: August 28, 2021

1995 journal article

An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions

Zeitschrift Für Operations Research, 42(3), 325–343.

By: H. Tsao* & S. Fang n

TL;DR: An unconstrained dual approach and an efficient algorithm for solving Karmarkar-type linear programming problems and a globally convergent curved-search algorithm with a quadratic rate of convergence are proposed. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Implementation of an inexact approach to solving linear semi-infinite programming problems

Journal of Computational and Applied Mathematics, 61(1), 87–103.

author keywords: SEMIINFINITE PROGRAMMING; LINEAR PROGRAMMING; ENTROPY OPTIMIZATION
TL;DR: An extended version of the inexact approach proposed by Fang and Wu (1994) for solving linear semi-infinite programming problems is implemented and results confirm that the inexacts approach is indeed more efficient and more robust than the exact approach. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems

Transportation Science, 29(4), 353–365.

By: S. Fang n & H. Tsao

TL;DR: This paper focuses on a class of linearly-constrained entropy maximization problem with quadratic cost, study its Lagrangian dual, and provides a globally convergent algorithm with a quadratics rate of convergence. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

A New Approach to Tolerance Allocation in Design Cost Analysis

Engineering Optimization, 24(4), 283–291.

By: J. Rajasekera* & S. Fang*

author keywords: TOLERANCE ALLOCATION; COMPUTER AIDED DESIGN; DESIGN FOR MANUFACTURABILITY; CONVEX OPTIMIZATION
TL;DR: This paper focuses on the tolerance allocation stage, and an O(n log2n) algorithm is developed for optimally allocating the total design tolerance among the n constituent components of a product. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Unconstrained convex programming approach to linear programming

Journal of Optimization Theory and Applications, 86(3), 745–752.

By: Z. Xu* & S. Fang n

author keywords: CONVEX PROGRAMS; LINEAR PROGRAMS; PERTURBATIONS; DUALITY
TL;DR: A necessary and sufficient condition for the existence of a dual optimal solution to the perturbed problem is presented and a sharp upper bound of error estimation in this approximation scheme is provided. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Solving stochastic programming problems via Kalman filter and affine scaling

European Journal of Operational Research, 83(3), 503–513.

By: S. Puthenpura*, L. Sinha*, S. Fang n & R. Saigal*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

On the point-to-point connection problem

Information Processing Letters, 53(6), 333–336.

By: M. Natu n & S. Fang n

author keywords: ALGORITHMS; POINT-TO-POINT CONNECTION PROBLEM; DYNAMIC PROGRAMMING; COMPUTATIONAL COMPLEXITY
TL;DR: A Dijkstra-like algorithm for solving the point-to-point connection problem on a finite directed network is presented and it is shown that the time complexity of the algorithm is O ( n 4 ). (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

Computers & Mathematics with Applications, 29(8), 7–18.

By: R. Sheu*, S. Wu* & S. Fang n

author keywords: SEMIINFINITE LINEAR PROGRAMMING; PRIMAL-DUAL METHOD; INFEASIBLE-INTERIOR-POINT METHOD
TL;DR: An algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming enjoys the advantages of having “multiple inexactness” and “warm start” for computational efficiency. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Entropy Optimization Models with Convex Constraints

Information and Computation, 116(2), 304–311.

By: S. Fang n & J. Rajasekera n

TL;DR: 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 ? (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Implementation and utilization of a decentralized storage system: Costing model

International Journal of Operations and Production Management, 15(9), 210–219.

By: T. Sargent n & M. Kay n

Contributors: T. Sargent n & M. Kay n

author keywords: costing; decentralization; modelling; storage
TL;DR: Through the process of solving the cost model, a new layout will be created for the decentralized storage system, which includes the placement of the additional material storage and receipt areas as well as the rearrangement of the other departments in the facility. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: ORCID
Added: April 29, 2020

1995 conference paper

Essential visibility graph: an approach to global motion planning for autonomous mobile robots

Proceedings - IEEE International Conference on Robotics and Automation, 2, 1958–1963.

By: J. Janet n, R. Luo n & M. Kay n

Contributors: J. Janet n, R. Luo n & M. Kay n

TL;DR: The result of eliminating redundant path segments is a streamlined version of the V-graph called the essential visibility graph (EVG), and it is shown that the EVG offers a significant reduction in data storage requirements and complexity. (via Semantic Scholar)
Source: ORCID
Added: April 29, 2020

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.