✦ LIBER ✦

Automatic program generation for PC-based sequence control problems

✍ Scribed by N.U. Gunasena; E.A. Lehtihet

Publisher: Society of Manufacturing Engineers
Year: 1991
Tongue: English
Weight: 901 KB
Volume: 10
Category: Article
ISSN: 0278-6125
DOI: 10.1016/0278-6125(91)90013-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Automatic program generation for PC-base

Automatic program generation for PC-based sequence control problems: N. Gunasena, E. Lehtihet, pp. 109–20

📂 Article 📅 1993 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 131 KB

A PC-based water level controller for nu

A PC-based water level controller for nuclear steam generators

✍ M.G. Na; S.P. Kim; W.K. Chung; K.J. Lee; J.S. Song; H.C. No; J.Y. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 495 KB

Generalized MPLS-based distributed contr

Generalized MPLS-based distributed control architecture for automatically switched transport networks

✍ Yangguang Xu; Patrice N. Lamy; Eve L. Varma; Ramesh Nagarajan 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 88 KB

An inverse dynamics-based dynamic progra

An inverse dynamics-based dynamic programming method for optimal control problems of linear systems

✍ Chen-Wen V. Yen; Tsong-Zen Liu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

In solving optimal control problems, the conventional dynamic programming method often requires interpolations to determine the optimal control law. As a consequence, interpolation errors often degenerate the accuracy of the conventional dynamic programming method. In view of this problem, this pape

A scenario-based stochastic programming

A scenario-based stochastic programming model for the control or dummy wafers downgrading problem

✍ Shu-Hsing Chung; Yi-Shu Yang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB

## Abstract The subject of this paper is to study a realistic planning environment in wafer fabrication for the control or dummy (C/D) wafers problem with uncertain demand. The demand of each product is assumed with a geometric Brownian motion and approximated by a finite discrete set of scenarios.