Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 10 (1997), No. 11

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 36 (2023)

  2. Vol. 35 (2022)

  3. Vol. 34 (2021)

  4. Vol. 33 (2020)

  5. Vol. 32 (2019)

  6. Vol. 31 (2018)

  7. Vol. 30 (2017)

  8. Vol. 29 (2016)

  9. Vol. 28 (2015)

  10. Vol. 27 (2014)

  11. Vol. 26 (2013)

  12. Vol. 25 (2012)

  13. Vol. 24 (2011)

  14. Vol. 23 (2010)

  15. Vol. 22 (2009)

  16. Vol. 21 (2008)

  17. Vol. 20 (2007)

  18. Vol. 19 (2006)

  19. Vol. 18 (2005)

  20. Vol. 17 (2004)

  21. Vol. 16 (2003)

  22. Vol. 15 (2002)

  23. Vol. 14 (2001)

  24. Vol. 13 (2000)

  25. Vol. 12 (1999)

  26. Vol. 11 (1998)

  27. Vol. 10 (1997)

  28. Vol. 9 (1996)

  29. Vol. 8 (1995)

  30. Vol. 7 (1994)

  31. Vol. 6 (1993)

  32. Vol. 5 (1992)

  33. Vol. 4 (1991)

  34. Vol. 3 (1990)

  35. Vol. 2 (1989)

  36. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 10 (1997), No. 11

Optimal Scheduling for a Three-Machine Robotic Cell with Finite Buffer

Hiroshi KISE, Yoshiyuki KARUNO, Kouji OHTSU

pp. 567-574

Abstract

This paper discusses an optimal scheduling problem for a three-machine robotic cell with finite buffer for WIP's (Work-In-Process) such as FMC's (Flexible Manufacturing Cells), where jobs are processed on three machines in the same order, and sent between machines by a transportation robot. The objective is to find an optimal schedule that minimizes the maximum completion time (i.e., the makespan). In this paper we propose heuristic algorithms employing a fuzzy inference and tabu search technique. Numerical experiments show that the proposed heuristics give good approximate schedules for any size of buffer capacity.

Bookmark

Share it with SNS

Article Title

Optimal Scheduling for a Three-Machine Robotic Cell with Finite Buffer

A Batch Manufacturing Information Management System Based on Active Mechanism and Multidimensional View Generation

Hideyuki TAKADA, Hiromitsu SHIMAKAWA, Yoshitomo ASANO, Morikazu TAKEGAKI

pp. 575-584

Abstract

In batch manufacturing information management systems, software productivity is a big problem because it is difficult to provide commonly-utilized software layer due to differences of plant facilities and production processes among target plants. In this paper, we present a model of a batch tracing mechanism and a view generation mechanism which can be utilized as a software layer organizing a batch manufacturing information management system. In addition, we confirmed that an application of this software layer for a model plant can be performed in short time and run-time performance is good enough for a practical use.

Bookmark

Share it with SNS

Article Title

A Batch Manufacturing Information Management System Based on Active Mechanism and Multidimensional View Generation

Design of Temperature Control System with Preview Action for Coke Oven Plant

Toshiaki ITOH, Satoru NUNOKAWA, Osamu SUENAGA, Tohru KATAYAMA

pp. 585-593

Abstract

This paper considers an identification and design of temperature control system for a coke oven plant. We first develop a linear state-space model by identifying two ARX models based on the input-output data of the plant. Then we derive a digital tracking control system with feedforward and preview actions by applying the techniques of Refs. 2) and 3). The tracking performance of the designed control algorithm is evaluated by extensive simulation studies. It is shown that the control algorithm with the preview actions on the coal charge and reference temperature has a potential applicability for automating the operation of coke oven plant.

Bookmark

Share it with SNS

Article Title

Design of Temperature Control System with Preview Action for Coke Oven Plant

An Adaptive Setting Method of Step-Size Parameter in NLMS Algorithms

Jiro MORIMOTO, Yoshikazu YAMAMOTO, Ikunori KOBAYASHI, Nanayo FURUMOTO, Toshiaki TABUCHI

pp. 594-606

Abstract

A major, and yet unresolved, problem has been the choice of the step-size in some parameter tracking algorithms. This paper presents an adaptive setting method of step-size parameter for tracking time-varying parameters when normalized least mean square (NLMS) algorithm is used. The usual method suggested by Benveniste et al is to adjust the step-size so as to minimize the performance measure defined by the mean squares of prediction error. The weak point of this method is that the performance measure converges only on a local minimum.
The main object of this paper is to give a solution for this problem. The solution obtained is that the performance measure converges on the global minimum through the minimization of another performance measure. As a result, the proposed algorithm becomes asymptotically optimal.
Numerical examples indicate acceptable performance of the proposed method.

Bookmark

Share it with SNS

Article Title

An Adaptive Setting Method of Step-Size Parameter in NLMS Algorithms

Level Control of a Continuous Casting Machine via H Control Theory

Akira MURAKAMI, Yoshiharu NISHIDA, Takashi MIKI, Toru MATSUURA, Masaru NAKAO

pp. 607-615

Abstract

In this paper, we apply H control theory to the level-control of a continuous casting machine. The level-control has two major problems of parameter variations and disturbance-pattern variations. In order to cope with these problems, we make up a table which consists of multiple H controllers. By switching one H controller to another properly, adaptability as well as robustness is achieved. This method has been applied to an actual machine and the results show a 40% decrease in level error.

Bookmark

Share it with SNS

Article Title

Level Control of a Continuous Casting Machine via H Control Theory

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.