Transactions of the Institute of Systems, Control and Information Engineers
New Arrival Alert : OFF

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

Log in / Sign up
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668

Transactions of the Institute of Systems, Control and Information Engineers Vol. 33 (2020), No. 6

  • A Neighborhood Limitation Method for Job-Shop Scheduling Based on Simulated Annealing

    pp. 171-181

    Bookmark

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

    Log in / Sign Up

    DOI:10.5687/iscie.33.171

    Because of non-deterministic polynomial time hardness of job-shop scheduling problem (JSP), approximate optimization based on meta-heuristics has been actively discussed. Considering position of planners in production sites, it is desirable to develop a method in which their know-how is respected. An approach for meeting this requirement is to set the schedule generated by a planner as the initial solution and then gradually improve the solution by repeating a search in its neighborhood so that he/she can follow and thoroughly examine the improved solution. For this reason, this research is focused on scheduling using simulated annealing (SA). Because SA has a disadvantage that good solutions cannot be obtained efficiently if the initial solution has not been given appropriately, methods for solving this problem have been proposed for JSPs aiming at minimizing makespan. In high-mix low-volume manufacturing, it is also important to minimize production lead time to reduce work-in-process inventory. This research takes up production lead time defined as the time between the starting and the finishing times of a job considering strong constraint on places for putting works-in-process in production of large equipment, and deals with development of an efficient method using SA for JSPs aiming at minimizing the average value of the production lead times. Two methods of neighborhood limitation in SA for reducing the evaluation value were developed by focusing on waiting time of operations. It was proven that using one of the proposed methods in SA with appropriate probabilities is effective to JSPs of a certain size by numerical examples.
  • Greedy-Based Approximation Algorithm for Solving Path Planning Problem of a Land Leveler

    pp. 182-190

    Bookmark

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

    Log in / Sign Up

    DOI:10.5687/iscie.33.182

    This study proposes a greedy-based approximation algorithm to determine the route of a land leveler, which is a type of agricultural machine for leveling and flattening the surfaces of fields. First, we describe the definition and the formulation of the land leveler problem (LLP) and show the exact solution based on dynamic programming for solving the LLP. Second, we propose the approximation algorithm and compare three visit functions which are used in the algorithm. Third, the comparison between the approximation algorithm and the exact solution is shown. Fourth, we apply the approximation algorithm to measurement data of a real field. Finally, we verify the validity of the movement constraint which is assumed for computing the route.
  • Update Method of Cost Function to Learn Robust Policy Parameters

    pp. 191-200

    Bookmark

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

    Log in / Sign Up

    DOI:10.5687/iscie.33.191

    Because robotic experiments are often expensive in time and/or money, it is a common idea to use simulations instead of real robot experiments to have a robot acquire a motion through reinforcement learning. However, simulation models inevitably have some modeling errors, because of which the solution can be an inappropriate one for the real robot. As a solution to this problem, additional learning processes will be performed using the real robot in many studies, but for some robots and tasks, it will be difficult or infeasible. Therefore, learning methods that can find a robust solution without real robot experiments are desirable. This paper proposes a novel method to update the cost function so that the minimization of the cost will lead to a robust solution, only using simulations. As the method only modifies the cost, the convergence to a solution will not be a problem, unlike the existing method that is based on a similar idea. The validity of the idea is tested by simulations.
  • Data-Driven Design of Feedforward Controllers with Performance Guarantee

    pp. 201-206

    Bookmark

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

    Log in / Sign Up

    DOI:10.5687/iscie.33.201

    In this paper, we propose a data-driven design of feedforward controllers so that closed-loop characteristics of two-degree-of-freedom control systems can be theoretically guaranteed. The controller is designed by finite-time markov parameter matching. We first show an upper bound of the error between a desired closed-loop performance and that achieved by the designed controller. Based on this error analysis, an iterative algorithm, where data collection and the error bound estimation are iteratively performed, is proposed for designing a feedforward controller with a desired error precision. The effectiveness of the proposed algorithm is shown through a numerical simulation.

Article Access Ranking

01 Aug. (Last 30 Days)

  1. Production and Technology of Iron and Steel in Japan during 2020 ISIJ International Vol.61(2021), No.6
  2. Perspective toward Long-term Global Goal for Carbon Dioxide Mitigation in Steel Industry Tetsu-to-Hagané Vol.105(2019), No.6
  3. Effect of Ore Type and Gangue Content on Carburization and Melting Behavior of Carbon-Iron Ore Composite ISIJ International Vol.61(2021), No.6
  4. Viscosity of Na–Si–O–N–F Melts: Mixing Effect of Oxygen, Nitrogen, and Fluorine ISIJ International Vol.60(2020), No.12
  5. Comprehensive Research about Critical Interaction Region Named Cohesive Zone in Series of Dissected Blast Furnaces ISIJ International Vol.61(2021), No.6
  6. Behavior of Jet from Nozzle Set on Side Wall of Lance ISIJ International Vol.61(2021), No.6
  7. Method for Simulating Gas Permeability of a Coke Bed Including Fines Based on 3D Imaging on the Coke Particle Morphology ISIJ International Vol.61(2021), No.6
  8. Carbon Enrichment of Austenite during Ferrite-bainite Transformation in Low-alloy-steel Tetsu-to-Hagané Advance Publication
  9. Formation and Evolution of Inclusions in High Chromium Steel ISIJ International Advance Publication
  10. Effect of Impeller and Gas Stirring on Agglomeration Behavior of Polydisperse Fine Particles in Liquid ISIJ International Vol.61(2021), No.6

Search Phrase Ranking

01 Aug. (Last 30 Days)

  1. blast furnace
  2. blast furnace productivity
  3. nozzle clogging
  4. 34crmo4 pressure vessel
  5. high hole expansion ratio
  6. 34crmo4
  7. blast furnace permeability
  8. carburization
  9. frp cylinder using cr−mo steel liner for storing high pressure hydrogen gas
  10. gas carburization