logo
Language
Bookmarks
Log Out

Journals

Search Sites

Account

© 2022 Steel Science Portal

How to use

Advanced Search

Search Sites

site
site
site
site

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

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

Backnumber

  1. Vol. 37 (2024)

    1. No.9
    2. No.8
    3. No.7
    4. No.6
    5. No.5
    6. No.4
    7. No.3
    8. No.2
    9. No.1

  2. Vol. 36 (2023)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  3. Vol. 35 (2022)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  4. Vol. 34 (2021)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  5. Vol. 33 (2020)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  6. Vol. 32 (2019)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  7. Vol. 31 (2018)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  8. Vol. 30 (2017)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  9. Vol. 29 (2016)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  10. Vol. 28 (2015)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  11. Vol. 27 (2014)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  12. Vol. 26 (2013)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  13. Vol. 25 (2012)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  14. Vol. 24 (2011)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  15. Vol. 23 (2010)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  16. Vol. 22 (2009)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  17. Vol. 21 (2008)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  18. Vol. 20 (2007)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  19. Vol. 19 (2006)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  20. Vol. 18 (2005)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  21. Vol. 17 (2004)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  22. Vol. 16 (2003)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  23. Vol. 15 (2002)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  24. Vol. 14 (2001)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  25. Vol. 13 (2000)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  26. Vol. 12 (1999)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  27. Vol. 11 (1998)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  28. Vol. 10 (1997)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  29. Vol. 9 (1996)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  30. Vol. 8 (1995)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  31. Vol. 7 (1994)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  32. Vol. 6 (1993)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  33. Vol. 5 (1992)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  34. Vol. 4 (1991)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  35. Vol. 3 (1990)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  36. Vol. 2 (1989)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  37. Vol. 1 (1988)

    1. No.7
    2. No.6
    3. No.5
    4. No.4
    5. No.3
    6. No.2
    7. No.1

Keyword Ranking

22 Dec. (Last 30 Days)

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

A Tank Lorry Scheduling System for Oil Delivery

Kei OHTSUKA, Makoto NISHIDA, Kazutaka TOTANI, Izumi YAMANISHI, Susumu SAITO

pp. 89-97

DOI:

10.5687/iscie.10.89

Abstract

Tank lorry scheduling is fundamental in the management of oil delivery facilities. A set of lorries is scheduled in a cost effective way to meet oil demands from a number of gas stations. The complexity of the scheduling arises from the diversity of constraints on oil delivery environments. The paper studies a lorry scheduling system alternative to a human scheduler taking an example of actual oil delivery facilities. Recent development in artificial intelligence leads to the use of knowledge based techniques : A method so called filtered beam search is applied to reduce combinatorially explosive search spaces. A number of combinations are omitted from the solution using the fact that most gas stations are scattered along with main roads. Another method which is used for multiattribute decision analysis is applied to evaluating candidates for a feasible solution. Each is characterized by the following four attributes : vacant lorry space, assigned delivery time, assigned lorry type, and the number of lorry hatches. A prototype system is developed for the lorry scheduling in the actual oil delivery facility. The schedules produced by the system are compared with those created by the human scheduler to verify the usefulness of the system.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Tank Lorry Scheduling System for Oil Delivery

twitter
facebook
mendeley

Bibtex

Ris

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

Hiroshi KISE, Yoshiyuki KARUNO, Shinji NAKAMURA

pp. 98-106

DOI:

10.5687/iscie.10.98

Abstract

This paper discusses optimal flexible cyclic scheduling for a two-machine robotic cell with finite buffer for WIP's (work-in-process) such as FMC's (flexible manufacturing cells), where jobs are processed on two machines in the same order, and sent between machines by a transportation robot. Each cycle is allowed to have different types of jobs, and the objective is to find an optimal schedule that minimizes the cycle times. In this paper we propose a heuristic algorithm based on Gilmore-Gomory and Johnson methods for this problem, and show by numerical experiments that it gives good approximate schedules of about 2% or less relative errors for any size of buffer capacity in short computational time. Also, we numerically show how the system parameters affect the system efficiency, and conclude that one of the effective ways for improving the efficiency is to reduce the diversity of job processing times rather than to have large buffer and a fast transportation robot.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

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

twitter
facebook
mendeley

Bibtex

Ris

Autonomous Decentralized Scheduling System for an Operation Assignment Problem

Atsuhiko FUKUI, Hitoshi IIMA, Nobuo SANNOMIYA

pp. 107-115

DOI:

10.5687/iscie.10.107

Abstract

This paper deals with assigning N operations on parallel H machines. The earliest start time, the latest finish time and the processing time are defined for each operation. The problem is to minimize the deviation of each processing time from the desirable time interval. We propose two autonomous decentralized scheduling algorithms to solve this problem. In these algorithms, an operation is transferred from one machine to another machine on the basis of information exchanges and cooperation among subsystems. By examining numerical results, a comparison is made between two algorithms from the viewpoints of accuracy and computation time. Consequently, abetter algorithm is found to be the one based on negotiations of one subsystem with the others.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Autonomous Decentralized Scheduling System for an Operation Assignment Problem

twitter
facebook
mendeley

Bibtex

Ris

Petri Net Based Object Behavior Modeling and Work Scheduling in Workflow

Atsushi INAMOTO

pp. 116-126

DOI:

10.5687/iscie.10.116

Abstract

In this paper, we take up two of the most serious technical problems aiming at the practical workflow implementation, namely, how to build up the model of workflow and how to set up and solve the optimum work-schedule problem. First, for precise dynamic modeling of workflow, we establish the timed Petri Net models which are converted from state transition models based on object-oriented modeling technique (OMT). Then, we define the optimum work scheduling problem on those timed Petri Net models and develop the solution of that problem depending on linear programming techniques. Further, we set up supplemental constraints for the linear programming to avoid resource conflicts between objects in workflow. Finally, we present the numerical calculation results of our practical studies in order to prove the feasibility and efficiency of our solution.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Petri Net Based Object Behavior Modeling and Work Scheduling in Workflow

twitter
facebook
mendeley

Bibtex

Ris

A Genetic Algorithm for a Bicriteria Flow-Shop Scheduling Problem

Hiroyuki MORITA, Naoki KATOH

pp. 127-136

DOI:

10.5687/iscie.10.127

Abstract

In this paper, we consider a bicriteria two-machine flow-shop scheduling problem which is to simultaneously minimize both Cmax and Tmax criteria, and we propose a new genetic algorithm for enumerating all nondominated solutions for this problem. Our algorithm is constructed by incorporating several existing strategies developed for multi-objective optimization problems together with a new strategy which we call seeding strategy that seeds some good individuals in the initial population. We perform computational experiments in order to compare our algorithm with other existing methods.We observe from our computational results that our algorithm produces nondominated solutions very close to exact ones, and outperforms other existing heuristics.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Genetic Algorithm for a Bicriteria Flow-Shop Scheduling Problem

twitter
facebook
mendeley

Bibtex

Ris

Development of Production Scheduling System for Flexible Transfer Line

Naohiro MORI, Hiroshi TAKASE, Susumu FUJII

pp. 137-143

DOI:

10.5687/iscie.10.137

Abstract

This paper considers the production scheduling of a flexible transfer line which produces parts for multiple agricultural machinery models. The schedule must be planned so that the parts are supplied efficiently to the assembly line in the production plant. The scheduling problem in this study is divided into lot sizing and lot sequencing problems; the lot sizing problem determines the standard lot for each part type and the lot sequencing problem determines the production sequence of standard lots. In this paper, we propose an algorithm combining heuristics and SA method to solve the lot sequencing problem and describe a system developed to support the daily planning operations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Development of Production Scheduling System for Flexible Transfer Line

twitter
facebook
mendeley

Bibtex

Ris

Application of Repetitive SA Method to Scheduling Problems of Chemical Processes

Yoshihiro MURAKAMI, Hironobu UCHIYAMA, Shinji HASEBE, Iori HASHIMOTO

pp. 144-151

DOI:

10.5687/iscie.10.144

Abstract

One of the predominant characteristics of chemical batch processes is that the material leaving a batch unit is fluid. Therefore, the starting times of jobs at each unit must be determined by taking into account the availability of storage between two units. In this paper, for such chemical processes, a scheduling algorithm using simulated annealing (SA) method is proposed. In the proposed method called repetitive SA method, in order to reduce the probability of being trapped in a : bad local optimum, the scheduling using SA method is executed repeatedly, and a best schedule is selected at the final stage of repetition. The problem is how to determine the number of repetitions of scheduling and the number of schedules searched in a round of scheduling.
In order to find out the best combination of those two numbers, first the probability distributions of the performances of the schedules are calculated for various cases where the number of schedules searched in a round of scheduling is different from one another. Then, the best combination of those numbers is selected using the derived probability distributions.
The results of applying the repetitive SA method to scheduling problems of chemical processes suggest that the proposed method is effective typically in reducing the deviation of the performances of the schedules.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Application of Repetitive SA Method to Scheduling Problems of Chemical Processes

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

22 Dec. (Last 30 Days)

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.