Journal of Japan Industrial Management Association
Online ISSN : 2187-9079
Print ISSN : 1342-2618
ISSN-L : 1342-2618
Volume 59 , Issue 1
Showing 1-20 articles out of 20 articles from the selected issue
  • Type: Cover
    2008 Volume 59 Issue 1 Pages Cover1-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (1772K)
  • Type: Cover
    2008 Volume 59 Issue 1 Pages Cover2-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (1772K)
  • Type: Index
    2008 Volume 59 Issue 1 Pages Toc1-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (52K)
  • Tetsuo YAMADA, Satomi KAKEFUDA, Hiroshi NAGATOMO, Masayuki MATSUI
    Type: Article
    2008 Volume 59 Issue 1 Pages 1-10
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In recent manufacturing, environmental changes such as small lot sizes, shifting production overseas, the use of temporary workers and worker motivation occur in assembly work, and a new assembly system called Cell Production System, which has self-completion stations as well as traditional assembly lines with the division of labor and conveyors, has been introduced. The operation efficiency of assembly systems should be discussed under the application of viable demands since the workloads determined by cycle times and the number of stations are constant. This study strategically compares the assembly line systems (ALS) to the cell production system including the flexible cell system (FCS) under the application of viable demands using the pair matrix table applying the production lot sizes and the number of stations, and discusses efficient assembly systems based on demand fluctuations. First, the respective models such as ALS, autonomous cell system (ACS) and FCS are briefly summarized, and an assembly problem is prepared. Next, simulators are constructed for the respective models, and the pair matrix tables with the profit and leadtime are drawn and shown. Finally, the efficient assembly systems are discussed based on the pair matrix tables. Here, FCS consists of multiple self-completion stations connected by conveyors and is efficient in view of material flow and process, and its superiority is comparatively shown.
    Download PDF (1154K)
  • Hisashi YAMAMOTO, Atsushi SUZUKI, Daiki KOHARA
    Type: Article
    2008 Volume 59 Issue 1 Pages 11-20
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    We consider multi-floor facility layout problems where lmn machines (facility modules) are assigned to cells. These cells are arranged into a rectangular pattern with l floors, m rows, and n columns. As the objective function, we consider flow costs and adjacent factors between machines. In these facility layout problems, we aim to obtain the machine layout that has the minimum objective value namely, the optimal layout. In precedent research on single-floor facility layout problems, Yamamoto et al.[8],[17] proposed a condition which enumerates only original layouts and automatically removes the layouts that are different due to rotation and/or reverse operation but have same objective value. They call it the condition for removing symmetry. They also proposed an efficient algorithm using this condition, which is based on a branch and bound method. In this paper, we expand the condition in order to apply it to multi-floor facility layout problems. We also propose two kinds of efficient algorithms for these facility layout problems using the condition, which are based on a branch and bound method. Moreover, these algorithms adopt a characteristic proper to multi-floor facility layout problems. We executed some numerical experiments with a personal computer in order to compare our proposed algorithms with existing algorithms. The results show that our proposed algorithm is useful.
    Download PDF (1043K)
  • Masaharu IWASE, Katsuhisa OHNO
    Type: Article
    2008 Volume 59 Issue 1 Pages 21-33
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper discusses a discrete-time make-to-order production-inventory system with stochastic production capacity and stochastic demand. Parts used in the production process are supplied by a vendor utilizing a constant lead time. The inventory of parts is controlled by a replenishing point system. The state of the production-inventory system is modeled as a discrete time M/G/1 type Markov chain. A performance evaluation method is derived using the structure of the transition probability matrix of the system. The average back-logged demand and average inventory of parts in the equilibrium state are derived from the demand distribution, production capacity distribution, lead time and replenishing point of parts. With these results, an algorithm is developed for determining an optimal replenishing point of parts that minimizes the average total cost per period consisting of the average back-logged cost of demand and average inventory cost of parts. Some numerical examples are given.
    Download PDF (1067K)
  • Takuya SERIZAWA, Kenji MURAMATSU
    Type: Article
    2008 Volume 59 Issue 1 Pages 34-49
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In production scheduling problems, it is not rare that, due to the fluctuation of short-term demand, the amount of order entry may exceed process capacity. This paper discusses a multi-item, multi-process dynamic lot size scheduling problem in which due date tardiness is allowed in order to find a feasible solution. We present a method of solving the problem by reducing it to a problem without tardiness that has been already known. It consists of: (1) extension of the planning horizon used for the solution method, if necessary; (2) allowing a backlog of echelon inventory, but not allowing it as real inventory; (3) adding due date tardiness penalty cost to the objective function; and (4) applying the Lagrangean decomposition coordination method together with heuristics. Finally, we verify the feasibility of the solution method by numerical illustration.
    Download PDF (1716K)
  • Hiroyuki NAGASAWA, Masaya NISHIMURA, Kazuko MORIZAWA
    Type: Article
    2008 Volume 59 Issue 1 Pages 50-57
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Various models have been proposed for dealing with uncertainties in production planning or scheduling. Some kinds of uncertainties can be formulated as scenarios with occurrence probabilities, and either the expected criterion value based on occurrence probabilities or the worst criterion value is usually minimized to find a 'robust' optimal solution. In the latter case, scenarios are treated equally no matter how high the occurrence probabilities are, resulting in a worse criterion value for scenarios with high occurrence probabilities. The former case contrarily tends to provide a much worse criterion value for scenarios with very low occurrence probabilities. To overcome this drawback, we introduce a cumulative distribution function (c.d.f.) of closeness under a set of scenarios with occurrence probabilities, and propose a method for finding a "robust optimal solution according to stochastic ordering." Introducing a set of basic cumulative density functions with various ranks, we define the rank of closeness for a solution as the smallest value of k so that the c.d.f. of closeness is not smaller at any value of closeness than any basic cumulative density function with a rank value greater than or equal to k in the meaning of "stochastic ordering." A robust optimal solution is generated as a solution with the smallest rank value among the feasible solutions. If we have several candidates for such a solution, either illustrating the c.d.f. of closeness for each solution or providing the rank value as a detailed real value helps a decision maker to select the final robust optimal solution from among the candidate solutions. A numerical example in a single-machine scheduling problem to minimize mean flow time is shown to demonstrate that the proposed robust optimal solution is superior to the other robust optimal solutions derived through expected criterion value minimization and min-max optimization methods.
    Download PDF (1066K)
  • Kunio SHIBATA, Junzo WATADA, Yoshiyuki YABUUCHI
    Type: Article
    2008 Volume 59 Issue 1 Pages 58-67
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Corporations in electric and electronic industry face severe competition all over the world. In Japan, some corporations have succeeded in accelerating their sales and production, however unfortunately, many corporations lost the power to advance in the 1990s. There are several reasons such as the influence of recession in Japan as well as in other markets around the world. Such causes and reasons should be clarified as to why some corporations could successfully accelerate their production even during the recession. In this paper, detailed data of focal corporations in the electric and electronics industries in Japan are scrutinized and analyzed. These days, balance sheets cannot express corporate performance without considering the influence of brands customer, employee, patents and so on. This paper analyzes Japanese electric and electronics corporations in terms of measuring intangible assets. Especially, this paper stresses the point of management of technology (MOT) and brand image in terms of corporate value. The results of our analysis explain why some corporations could be successful. Our analysis utilizes a fuzzy robust regression model. In this analysis, the system can automatically remove outliers from samples. So, this analysis can minimize the influence of the outliers. Each company has many influential features including the power of corporation scale, type of industry, number of employees and so on. Therefore, we obtain results with high reliability by means of applying fuzzy robust regression analysis.
    Download PDF (1131K)
  • Hiroyuki ONO, Toshio SANO, Yasusi NISHIZAKI, Tsutomu OHTA, Shuichiro O ...
    Type: Article
    2008 Volume 59 Issue 1 Pages 68-73
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Evaluating the environmental load and impact of industrial products throughout their lifecycles is important, and lifecycle assessment (LCA) will be indispensable for future manufacturing. As for LCA, it is described in ISO 14040, and many reports on the results of LCA have been published to date. However, the execution of LCA is difficult, especially for the manufacturing stage of fabrication industries, due to the complexity and particularity of the processes. It is difficult to examine the process precisely from an environmental viewpoint through conventional LCA in which the manufacturing stage is composed of a few unit processes. To cope with this problem, a manufacturing centered LCA with a hierarchical structure configuration is proposed, and this new assessment is applied to a machining process. The effective way to reduce environmental load and impact is to examine these values in the stage of designing parts and products. Since CAD/CAM systems are used in the designing stage for parts and processes, using of data from the systems is effective for environmental evaluation. In this paper, an environmental evaluation of the manufacturing stage in LCA is carried out. The fabrication of an automotive sensor component is evaluated. The results obtained concerning the environmental load and impact demonstrates the effectiveness of the proposed LCA method.
    Download PDF (763K)
  • Yukio MARUYAMA, Akiyuki SEIGO, Yasutaka KAINUMA, Hisashi YAMAMOTO
    Type: Article
    2008 Volume 59 Issue 1 Pages 74-84
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In the previous study, a formula of forecasting water demand was proposed using a multivariate regression analysis with correlation between water demand and the factors that heavily influence it. We also proposed a forecasting method that considers variations in economic conditions for the service area. In this paper, we apply the water demand forecasting method proposed for the Kanagawa prefectural waterworks service area to the water demand for Tokyo metropolitan area. Moreover, we obtain evaluation for regulation factors that reveal higher forecasting precision. Even so, the scale of water services for Tokyo metropolitan is larger than that of the Kanagawa prefectural area. Finally, we show that the forecasting method used for small-scale waterworks can be utilized for large-scale waterworks.
    Download PDF (1283K)
  • Katsuhiro SAKAMOTO, Yoshiki NAKAMURA
    Type: Article
    2008 Volume 59 Issue 1 Pages 85-93
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Authors tried to design an educational supply chain management (SCM) simulator and verify its application in effect to deepen the understanding of SCM. The purpose of the simulator is to achieve improvements in the ratio of target values: 1) lack of inventory, 2) loss of sales opportunities, 3) shorter lead-time, and 4) improve demand forecasts. In addition, the learner can understand the importance of information sharing, information analysis, production, and sales. The simulator model is composed of "market," "retail store," "sales company," "manufacturer," and "supplier." The market is broken down into two sub-markets, and two products are sold according to the each market. Product parts should be delivered from three suppliers. The manufacturer processes and constructs the products, and delivers them to five retail stores. The sales company collects the sales results from the retail stores and transmits the data to the manufacturer. There are four manufacturing companies: one learns progressively, and the other three are competitors that make decisions automatically. Therefore, the learning company should compete not only in sales, profit and market share, but also selection of the supplier for parts delivery. Moreover, from the educational viewpoint, the simulator has sufficient support functions to assist in decision-making problems or give advice when trouble is experienced. The proposed SCM simulator is to be used by graduate students for examining the effectiveness and understanding of SCM.
    Download PDF (1179K)
  • Mitsuyoshi Horikawa, Takeo Takeno, Mitsumasa Sugawara
    Type: Article
    2008 Volume 59 Issue 1 Pages 94-100
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    In recent years, farmers' markets have attracted considerable public attention in Japan. These farmers' markets can be described as stores managed by farmers who have organized an agricultural union for the purpose of ensuring a steady income. The number of such stores has been increasing and therefore, farmers have to compete with not only traditional methods, but also new management technologies. The purpose of this paper is to propose an information and communications technology (ICT) solution to overcome the problems experienced by farmers' markets. We propose an inventory management method based on vender inventory management (VMI). We have developed information systems that can support sales management and inventory management. We also introduced the information systems to a farmer market which is an agricultural producer's cooperative corporation. The system provides the following functions: 1) the information is utilized by the farmers, and 2) they promote the farmers' market. The systems make it possible to reinforce the differentiation and competitiveness of the store, and provide fresher crops according to demand. Moreover, providing the crop information gives customers a sense of security in terms of crop quality and increases convenience of the store.
    Download PDF (1073K)
  • Type: Bibliography
    2008 Volume 59 Issue 1 Pages 101-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (58K)
  • Type: Appendix
    2008 Volume 59 Issue 1 Pages 102-103
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (186K)
  • Type: Appendix
    2008 Volume 59 Issue 1 Pages App1-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (79K)
  • Type: Appendix
    2008 Volume 59 Issue 1 Pages App2-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (79K)
  • Type: Appendix
    2008 Volume 59 Issue 1 Pages App3-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (79K)
  • Type: Appendix
    2008 Volume 59 Issue 1 Pages App4-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (79K)
  • Type: Appendix
    2008 Volume 59 Issue 1 Pages App5-
    Published: April 15, 2008
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (79K)
feedback
Top