Steel Science Portal

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.

ONLINE ISSN: 2185-811X

PRINT ISSN: 1342-5668

Publisher :

THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Current Issue
Vol. 35 (2022)
- No. 3
- No. 2
- No. 1
Vol. 34 (2021)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 33 (2020)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 32 (2019)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 31 (2018)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 30 (2017)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 29 (2016)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 28 (2015)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 27 (2014)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 26 (2013)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 25 (2012)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 24 (2011)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 23 (2010)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 22 (2009)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 21 (2008)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 20 (2007)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 19 (2006)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 18 (2005)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 17 (2004)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 16 (2003)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 15 (2002)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 14 (2001)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 13 (2000)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 12 (1999)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 11 (1998)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 10 (1997)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 9 (1996)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 8 (1995)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 7 (1994)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 6 (1993)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 5 (1992)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 4 (1991)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 3 (1990)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 2 (1989)
- No. 12
- No. 11
- No. 10
- No. 9
- No. 8
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1
Vol. 1 (1988)
- No. 7
- No. 6
- No. 5
- No. 4
- No. 3
- No. 2
- No. 1

Home
Transactions of the Institute of Systems, Control and Information Engineers
Vol. 17 (2004), No. 6

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

Proposal of Production Planning and Management System for Implementing Mass Customization

Nobuyuki UENO, Kyozo FURUTA, Koji OKUHARA, Hiroaki SHIBUKI, Toshiaki KURAMOTO

pp. 221-229

Readers Likes, Comments, Shares
PDF (J-STAGE) Share
Share it with SNS
Proposal of Production Planning and Management System for Implementing Mass Customization

TwitterTweet
You can tweet with article title and URL.

FacebookShare
You can share URL of article published on line.

MendeleySave
You can save articles in your library.

BibTeX
You can download bibliographic data as BibTeX format.

RIS
You can download bibliographic data as RIS format.
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.17.221

Abstract

There is need for a business model to realize mass customization in the automobile industry. This paper proposes a production planning and management system for implementing mass customization. Firstly, the future collaboration model between a manufacturer and suppliers is introduced. And, a complete designing process for building a production planning and management system is proposed. Secondly, an estimating of unfulfilled order rate which gets the fraction of demand that is not satisfied from components in inventory is derived. Thirdly, we propose an iterative and practical algorithm which solves a production planning problem about mass customization to minimize the inventory holding cost and production cost subject to unfulfilled order rate, production constraints and so on. It is formulated as a probabilistic problem and it is solved effectively by using mathematical programming.
An Allocation Problem of Workers in a U-shaped Line

Shuhei HIRAO, Takahiro ITO, Koichi NAKADE, Mitsutoshi KOJIMA, Katsuhisa OHNO

pp. 230-240

Readers Likes, Comments, Shares
PDF (J-STAGE) Share
Share it with SNS
An Allocation Problem of Workers in a U-shaped Line

TwitterTweet
You can tweet with article title and URL.

FacebookShare
You can share URL of article published on line.

MendeleySave
You can save articles in your library.

BibTeX
You can download bibliographic data as BibTeX format.

RIS
You can download bibliographic data as RIS format.
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.17.230

Abstract

In this paper, we deal with a U-shaped production line with multiple multi-function workers. Each worker takes charge of multiple machines. We consider two types of allocations of workers to machines, a separate allocation and a carousal allocation. In the separate allocation, each worker takes charge of a unique set of machines and therefore at each machine the same worker operates items in every cycle. In the carousel allocation, all workers take charge of all machines in the same order. The processing times of the machines, and the operation and walking times of the workers are assumed to be independent and identically distributed random variables. We examine the influence of the variances of these processing, operation and walking times upon the cycle times of these allocation models by simulation and experimental design. We also examine the influences of the buffer sizes and the number of items in these buffers upon the cycle time, if the U-shaped line has some buffers and some items in them.
Hybrid Tabu Search Approach for Hierarchical Logistics Optimization

Yoshiaki SHIMIZU, Takeshi WADA

pp. 241-248

Readers Likes, Comments, Shares
PDF (J-STAGE) Share
Share it with SNS
Hybrid Tabu Search Approach for Hierarchical Logistics Optimization

TwitterTweet
You can tweet with article title and URL.

FacebookShare
You can share URL of article published on line.

MendeleySave
You can save articles in your library.

BibTeX
You can download bibliographic data as BibTeX format.

RIS
You can download bibliographic data as RIS format.
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.17.241

Abstract

Recent globalization of market raises outstandingly the importance of logistic optimization toward just-in-time and agile manufacturing. With this point of view, in this study, we have formulated a site location and route selection problem as a p-Hub problem with capacity constraints. It refers to a non-linear integer programming deciding simultaneously location of hubs and routes from plants to customers via hub facilities. To solve the problem practically as well as efficiently, we have developed a new and novel meta-heuristic method termed hybrid tabu search and implemented it in a hierarchical manner. It relies on a tabu search as the upper level algorithm, and a revised Dijkstra method under Lagrange relaxation for capacity constraints as the lower one. To accelerate the efficiency, we give unique methods to generate an initial hub location based on the minimum spanning tree of the nodes, and to adjust the Lagrange multipliers in imitation of auction mechanism regarding transport cost. Moreover, we adopt a multi-start routine in the aid of ant method to prevent from trapping into the local optimum. Through the numerical experiments that outperformed two popular commercial software, we confirmed effectiveness of the proposed method even for real-life applications.
Scheduling Re-entrant Flow Shop Problems by Local Search Methods

Kouichi TAJI, Yutaka KOYAMA, Yoshio IWATA

pp. 249-256

Readers Likes, Comments, Shares
PDF (J-STAGE) Share
Share it with SNS
Scheduling Re-entrant Flow Shop Problems by Local Search Methods

TwitterTweet
You can tweet with article title and URL.

FacebookShare
You can share URL of article published on line.

MendeleySave
You can save articles in your library.

BibTeX
You can download bibliographic data as BibTeX format.

RIS
You can download bibliographic data as RIS format.
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.17.249

Abstract

Semiconductor wafer fabrications are modeled as a re-entrant flow shop problem, in which the processing order of each lot is given, but each lot may enter a production line many times. Hence, a re-entrant flow shop is a very complicated problem, which has a property similar to a job shop problem. In this paper, we consider a scheduling method for a whole production line of re-entrant flow shop. A real wafer fabrication line consists of several hundreds of processes and requires re-scheduling many often. So we propose local search methods instead of seeking exact solutions. Some numerical results indicate that the proposed methods obtain good solutions in a short time.
Hybrid Solution Based on a Mathematical Model of a Class of Flexible Shop Scheduling Problems

Kazutoshi SAKAKIBARA, Hisashi TAMAKI, Hajime MURAO, Shinzo KITAMURA

pp. 257-263

Readers Likes, Comments, Shares
PDF (J-STAGE) Share
Share it with SNS
Hybrid Solution Based on a Mathematical Model of a Class of Flexible Shop Scheduling Problems

TwitterTweet
You can tweet with article title and URL.

FacebookShare
You can share URL of article published on line.

MendeleySave
You can save articles in your library.

BibTeX
You can download bibliographic data as BibTeX format.

RIS
You can download bibliographic data as RIS format.
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.17.257

Abstract

In this paper, we consider an extended class of flexible shop scheduling problems. First, we translate the problem into a mathematical programming formula, i.e., a mixed-integer programming problem. This makes it possible to apply standard packages of mixed integer programming solvers and, while lots of computational time is required in general, to obtain the optimal schedule. Then, in order to seek the schedules close to the optimal, we newly compose a solution method by adopting genetic algorithms based on the formula, and also we design a hybrid method in which integer programming methods and genetic algorithms are combined. Through some computational experiments, the effectiveness and the potential of the proposed approach are examined.

Article Access Ranking

01 Jul. (Last 30 Days)

Production and Technology of Iron and Steel in Japan during 2021 ISIJ International Vol.62(2022), No.6
Reduction of CO₂ Emissions from Blast Furnace Applying Reactive Coke Agglomerate and Hydrogen Reduction Tetsu-to-Hagané Vol.108(2022), No.6
Role of Interfacial Properties in the Evolution of Non-metallic Inclusions in Liquid Steel ISIJ International Advance Publication
Influence of Thermomechanical Treatment on Delayed Fracture Property of Mo-Bearing Medium-Carbon Steel ISIJ International Vol.62(2022), No.2
Preface to the Special Issue on “Frontier in Characterization of Materials and Processes for Steel Manufacturing” ISIJ International Vol.62(2022), No.5
Wettability of Molten Fe–Al Alloys against Oxide Substrates with Various SiO₂ Activity ISIJ International Advance Publication
Hierarchical Deformation Heterogeneity during Lüders Band Propagation in an Fe-5Mn-0.1C Medium Mn Steel Clarified through in situ Scanning Electron Microscopy ISIJ International Advance Publication
Application of Heat Transfer Coefficient Estimation Using Data Assimilation and a 1-D Solidification Model to 3-D Solidification Simulation ISIJ International Advance Publication
Comparison of Oxidation Behavior of Various Reactive Elements in Alloys during Electroslag Remelting (ESR) Process: An Overview ISIJ International Advance Publication
Nitrogen Solubility and Gas Nitriding Kinetics in Fe–Cr–Mo–C Alloy Melts under Pressurized Atmosphere ISIJ International Vol.62(2022), No.6

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

Proposal of Production Planning and Management System for Implementing Mass Customization

Share it with SNS

An Allocation Problem of Workers in a U-shaped Line

Share it with SNS

Hybrid Tabu Search Approach for Hierarchical Logistics Optimization

Share it with SNS

Scheduling Re-entrant Flow Shop Problems by Local Search Methods

Share it with SNS

Hybrid Solution Based on a Mathematical Model of a Class of Flexible Shop Scheduling Problems

Share it with SNS

Article Access Ranking

Search Phrase Ranking