Works Published in 1996
Displaying works 21 - 40 of 97 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1996 conference paper
Quantifying the benefits of cycle time reduction in semiconductor wafer fabrication
Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium, 130–136.
Event: Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium
Sources: Crossref, NC State University Libraries
Added: March 26, 2022
1996 conference paper
Effects of dispatching and down time on the performance of wafer fabs operating under theory of constraints
Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium. Presented at the Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium.
Event: Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium
TL;DR:
The results show that downtime at non-bottleneck machines has significant detrimental effects on fab performance, and that the Critical Ratio dispatching rule performs well in terms of the tradeoff between cycle time and throughput.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 26, 2022
1996 journal article
Decomposition methods for scheduling semiconductor testing facilities
International Journal of Flexible Manufacturing Systems, 8(4).
TL;DR:
Results indicate that decomposition methods can be successfully applied to complex scheduling problems of the type addressed in this paper, as well as the classical job shop problems addressed in previous research.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 6, 2022
1996 journal article
Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
Naval Research Logistics, 43(5), 709–719.
TL;DR:
This article considers the single-machine dynamic scheduling problem where the jobs have different arrival times and the objective is to minimize the sum of completion times and develops decomposition results that can be used with any implicit enumeration method to develop an optimal algorithm.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 6, 2022
1996 journal article
An iterative heuristic for the single machine dynamic total completion time scheduling problem
Computers & Operations Research, 23(7), 641–651.
TL;DR:
An iterative improvement heuristic which operates by modifying the problem data in a manner that allows one-pass heuristics to generate improved solutions to minimize the total completion time in the face of dynamic job arrivals is presented.
(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
1996 journal article
Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
The Journal of the Operational Research Society, 47(5), 666.
Sources: Crossref, NC State University Libraries
Added: March 6, 2022
1996 journal article
Neural network scheduling of a flexible manufacturing cell using dynamic process plans
International Journal of Flexible Automation and Integrated Manufacturing, 4(3-4), 213–229.
Source: NC State University Libraries
Added: December 26, 2021
1996 journal article
Constraint Preserving Integrators for Unstructured Higher Index DAEs
Zeitschrift Fuer Angewandte Mathematik Und Mechanik (ZAMM), 83–86.
Source: NC State University Libraries
Added: November 6, 2021
1996 conference paper
Pencil algorithms and observer design
Proceedings of the 1996 IEEE International Symposium on Computer-Aided Control System Design (CACSD), 83–88. New York: Institute of Electrical and Electronics Engineers.
Event: IEEE Symposium on Computer-Aided Control System Design at Dearborn, Michigan on September 15-18, 1996
Source: NC State University Libraries
Added: November 6, 2021
1996 conference paper
Descriptor predictive control: tracking controllers for a riderless bicycle
Proceedings of Computational Engineering in Systems Applications, 292–297. Lille, France.
Source: NC State University Libraries
Added: October 28, 2021
1996 conference paper
Nonlinear observer design using implicit system descriptions
In S. L. C. Wissel, R. Nikoukhah, & F. Delebecque (Eds.), Proceedings of Computational Engineering in Systems Applications (pp. 404–409). Lille, France.
Ed(s): S. Wissel, R. Nikoukhah & F. Delebecque
Source: NC State University Libraries
Added: October 28, 2021
1996 book
COW Users Manual
Little Rock, Arkansas: Winrock International.
Source: NC State University Libraries
Added: October 1, 2021
1996 report
COW - Cost of Wood Products, A software program for use in Secondary Wood Products Manufacturing
[Software]. Little Rock, Arkansas: Winrock International.
Source: NC State University Libraries
Added: October 1, 2021
1996 conference paper
Spatially explicit multi-objecitve analysis for timber and wildlife
Presented at the 1996 Society of American Foresters Convention, Albuquerque, NM.
Event: 1996 Society of American Foresters Convention at Albuquerque, NM
Source: NC State University Libraries
Added: September 30, 2021
1996 report
Soil Recovery and Regeneration of a Wetland Site One-Year After Harvest
(American Society of Agricultural Engineers Paper No. 965002). St. Joseph, MI: ASAE.
Source: NC State University Libraries
Added: September 30, 2021
1996 journal article
Just-in-Time Production Planning with Semi-Infinite Programming and Genetic Algorithms
Journal of Control and Decision, 11, 446–451.
Source: NC State University Libraries
Added: August 28, 2021
1996 journal article
An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
Journal of Computational and Applied Mathematics, 72(1), 127–139.
author keywords: linearly-constrained entropy optimization; infinite constraint set; cutting-plane method; duality
TL;DR:
A cutting-plane type algorithm for solving entropy optimization problems with a finite number of variables but an infinite number of linear constraints that shows its potential for solving large-scale problems.
(via Semantic Scholar)
doi.org (publisher)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021
1996 journal article
Parametric linear semi-infinite programming
Applied Mathematics Letters, 9(3), 89–96.
author keywords: semi-infinite programming; linear programming; convex programming
TL;DR:
It is shown that the solution of a linear semi-infinite programming problem can be obtained by solving a sequence of optimization problems with a single constraint.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021
1996 journal article
A dual perturbation view of linear programming
Mathematical Methods of Operations Research, 44(1), 1–9.
TL;DR:
This paper investigates a new perturbation scheme which obtains a dual optimal solution by perturbing the dual feasible domain under different norms and shows that it generalizes the primal entropic perturbations approach to linear programming.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021
1996 journal article
Solving min-max problems and linear semi-infinite programs
Computers & Mathematics with Applications, 32(6), 87–93.
author keywords: min-max problem; linear semi-infinite programming; convex programming; entropy optimization
TL;DR:
It is shown that an entropic regularization procedure can provide a smooth approximation F p ( x) that uniformly converges to F ( x ) over X, as p tends to infinity.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021
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.
