Journal of Japan Industrial Management Association
Online ISSN : 2187-9079
Print ISSN : 1342-2618
ISSN-L : 1342-2618
Volume 56 , Issue 5
Showing 1-19 articles out of 19 articles from the selected issue
  • Type: Cover
    2005 Volume 56 Issue 5 Pages Cover9-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (1807K)
  • Type: Cover
    2005 Volume 56 Issue 5 Pages Cover10-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (1807K)
  • Type: Index
    2005 Volume 56 Issue 5 Pages Toc5-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (57K)
  • Chao Rong, Katsuhiko Takahashi, Katsumi Morikawa
    Type: Article
    2005 Volume 56 Issue 5 Pages 313-320
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The multi-stage, multi-machine capacitated lot-sizing problem (MSMMCLSP) consists of scheduling the production of one product in a multi-machine production system with a multi-stage structure. This study first proposes an improved heuristic for the MSMMCLSP under deterministic demand over a finite planning horizon. Eliminating overloads by shifting the end item (e.g., all components) backward to a past period or forward to a future period, it uses Wagner-Whitin/lot-for-lot rescheduling to ensure schedule feasibility and uses an improving procedure to improve the scheduling of components in lower stages of production. Preliminary examination, however, revealed that this does not always optimize production schedules as well as the heuristic of Franca et al. does. We therefore developed an integrated heuristic that guarantees a better solution for general MSMMCLSP by combining the heuristic of Franca et al. and the improved heuristic. We also evaluate the effectiveness of the proposed heuristics by using a simulation test with various planning parameters.
    Download PDF (834K)
  • Aya Ishigaki, Shuhei Inada, Gilles Cormier, Yasuhiro Hirakawa
    Type: Article
    2005 Volume 56 Issue 5 Pages 321-329
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    A demand-centred enumerating method with a branch and bound algorithm has been proposed for solving earliness and tardiness production scheduling and planning problems. This method can obtain an optimal solution for small-scale problems within a practical computation time. For larger-scale problems, a decomposition heuristic method has been proposed, which divides the problem into several partial problems in terms of the planning horizon. The partial problems are sequentially connected by the inventory at the end of the planning horizon. The validity of the optimal solution method and heuristic method is verified in a large-scale numerical experiment.
    Download PDF (838K)
  • Ming Zhe CHEN, Naoto KATAYAMA, Hiroaki MOHRI
    Type: Article
    2005 Volume 56 Issue 5 Pages 330-338
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The network design problem, which attempts to simultaneously take into account facility location and network topology, has a number of applications in transportation network design, distribution systems, telecommunication network planning, and other areas. In this paper, we investigate a new model that simultaneously optimizes facility locations for distribution centers and concentrators, network topology for line-haul trucks and fiber-optic communication lines, and routes of commodity flow for freight and communication data. Our model consists of uncapacitated facility location, uncapacitated arc design, general network design, an unlimited number of freight transshipment at facilities, and multi-commodity flow routing that has a large number of origin-destination pairs. It has been noted that this model is not suitable for solving problems that exist in the real world with current OR software on the market. We present a new formulation of this problem that minimizes the sum of flow costs, arc design costs, and facility location costs, and a new Lagrange relaxation problem with relaxed flow conservation constraints and some forcing constraints. We present an exact solution method for this Lagrange relaxation problem, and a subgradient method for Lagrange multipliers. In addition, we present an approximate solution method for obtaining good upper bound using solutions of a Lagrange relaxation problem, which is called Lagrange heuristics. Numerical examples up to 100 nodes are given to show the effectiveness of our formulation and solution methods for lower and upper bound.
    Download PDF (862K)
  • Hiroshi OHTA, Hideaki YONEDA
    Type: Article
    2005 Volume 56 Issue 5 Pages 339-345
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Multi-item small-sized production has become common as the result of the diversified needs of consumers. Flexible Manufacturing Systems (FMSs) have made it possible to perform multi-item small-sized production efficiently. FMSs have been a focal point in manufacturing-related research since the early 1970s. Computer integration and system flexibility are the two critical factors of an FMS. It is believed that system flexibility is especially important for FMS, because a higher level of flexibility enables the manufacturing company to provide faster response to market changes while maintaining high product quality standards. But considering the high capital outlay required and moderate risk of a FMS investment, economic justification is insufficient since there is no way to figure in benefits such as flexibility and enhanced quality offered by advanced manufacturing technologies. Therefore, it is important is to both evaluate the alternatives of two or more FMSs, and to choose the best FMS based on multiple viewpoints in consideration of cost. Recently, Karsak used a fuzzy set for ambiguous data, and proposed a FMS evaluation algorithm for choosing the better FMS by considering existing alternatives and the decisions made by the decision-makers. In this paper, we propose the application of a New Fuzzy Weighted Average (NFWA) to the operation method of the FMS evaluation algorithm to improve consistency in FMS evaluation ranking. An investigation is carried out to determine the relation between the number of evaluation items determined by the decision-makers and the variation in the evaluation ranking of FMSs.
    Download PDF (648K)
  • Juvy BALINGIT, Hirokazu IWASE, Masatoshi KITAOKA
    Type: Article
    2005 Volume 56 Issue 5 Pages 346-357
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Using a three-dimensional motion analysis system, manual material handling posture is analyzed primarily through human body movement taken by a highspeed video camera. The angle of asymmetry, lifting height, distance from the load to both feet and load weight were the considerations for the 16-point data source of manual material handling posture. The method of converting the measured coordinates into 21 joint angles is shown. From the 16-point data, using various interpolation working conditions, the method to obtain the approximate expression of the working posture is shown. Then Virtual Reality Modeling Language (VRML) is used to create a human body model and the converted data is used to propose an animated working posture. Before any actual material handling takes place, given the respective working conditions, the working posture can be presented as an approximation through animation. As a result, before any actual work, given the working conditions, from the approximation formula, the joint angle is computed, and the method of interpolation is shown from the computer graphics. Then, the working posture is analyzed through the use of posture and action codes of the Ovako Working posture Analysis System (OWAS) method. Using mathematical computation and a material handling example of a human model, the procedure for formulating the OWAS posture and action codes is shown.
    Download PDF (1249K)
  • Kazunari TSUCHIMOTO, Kazuko MORIZAWA, Hiroyuki NAGASAWA
    Type: Article
    2005 Volume 56 Issue 5 Pages 358-365
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    This paper deals with a machine-unfixed, machining-assembly flowshop scheduling problem to minimize makespan, where there are M-parallel machining centers at a machining stage and one robot at an assembly stage. In this problem, both part assignments on M-parallel machining centers and a sequence of all jobs should be determined simultaneously, because M parts of each job can be processed on any machining center at the machining stage. Since this problem is NP hard, we propose a heuristic algorithm, called the "list-based squeezing branch and bound (LSQ)" algorithm, which searches the neighborhood of initial schedules in an enumerative manner by employing a branching procedure in a branch and bound algorithm (B & B). In the LSQ, some initial schedules are found first through using promising heuristic methods, and then a B & B-based parallel local search is implemented for obtaining an optimal (or a near-optimal) schedule. For increasing the effectiveness of the LSQ, a multi-start local search strategy and an iterated local search strategy are adopted into the searching process of the LSQ. The performance of the proposed method is compared with a one-hour truncated branch and bound algorithm and with the two existing heuristic methods. The results of numerical experiments show that the proposed method can provide a near-optimal solution with high accuracy such as the mean relative error being less than 0.3% and the maximum relative error being 3%.
    Download PDF (994K)
  • Akiko TAKEDA, Naoshi UCHIHIRA, Masashi NAKAMOTO, Shigeru MATSUMOTO
    Type: Article
    2005 Volume 56 Issue 5 Pages 366-376
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Investment planning is the selection of low-cost generation plants to meet customer demands over a multi-decade time horizon. In uncertain business environments, it is important to make management decisions considering not only the optimality, but also the uncertainties in productive activity. Here, we focus on the electric powerplants, treat the demand and energy price in the future as uncertain elements, and show a robust model of electric powerplant planning. The proposed robust model is formulated as a 0-1 integer programming problem which maximizes operating profit while satisfying future demand and dealing effectively with the anticipated variation in operating profit. The 0-1 integer problem tends to become large-size for the electric powerplant planning of existing Japanese companies, and it is difficult to solve the large-size 0-1 integer problem with standard methods such as the branch-and-bound method. Thus, we propose an alternative solution method that splits the 0-1 integer problem into many linear programs using the dynamic programming technique and solves them sequentially. The numerical results show that small-scale powerplants are suitable to cope with severe uncertainty even if the operating costs per unit of production of the small-scale plants are higher than those of large-scale plants. The effectiveness of our method is demonstrated with various kinds of test problems which vary the number of electric powerplants and the period of the electric powerplant planning.
    Download PDF (1369K)
  • Makoto NAKANO, Yasuhiro IIJIMA, Ichiro MIHARA, Takashige TAJIMA
    Type: Article
    2005 Volume 56 Issue 5 Pages 377-384
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The continued progression in the use of information technology (IT) calls for maintenance of the information infrastructure, various measures are being implemented at the national and local government levels. This paper discusses the automation measures being carried out by the local government of Hokuriku, and clearly shows the level of progress of each government and the information policies required regarding demand for information infrastructure maintenance. Furthermore, the level of information processing automation was categorized interms of areas requiring advanced computerization and autonomous computerization. Regarding a basic analysis of categorization, the information processing automization strategy of the Hokuriku local government was clarified.
    Download PDF (840K)
  • Mitsumasa KUMAZAWA
    Type: Article
    2005 Volume 56 Issue 5 Pages 385-393
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Recently, it has become clear that there is a problem of employees quitting their job soon after being hired. This report focuses on clarifying the processes of adaptation to occupations by carrying out continuous research on new workers from the aspect of conscious fatigue. The study focused on 11 girls who had graduated from a senior high school and started working in the clothing industry. The working posture is mainly sitting in a chair. The period of the research was 16 weeks from time of hire. In this research, the Questionnaire for Subjective Fatigue Feeling prepared by the Industrial Fatigue Research Committee of the Japan Association of Industrial Health was used. As a result, it was clarified that 7.3% of the subjects complained of conscious fatigue in the first week after joining the company, and that the percentage increased in parallel as the number of weeks passed. In the fifth week, the figure reached the maximum of 16.5%. At the same time, in fifth week, there was a significant difference for that repeated within a day (7.2%) and that within a week (10.4%), which was the maximum. After that, the figure started to decline, and from the eighth week onwards, complaints of conscious fatigue stabilized at around 10%. The type of the conscious fatigue was muscle fatigue for about the first three weeks, related to the processes of acquiring skill, where a time when muscular fatigue is mainly recognized by the individual. However, after that, it became a general type of fatigue despite a rise in the complaint rate. The results show that the conscious fatigue of senior high school graduate female employees required to work in a seated posture increases for the initial employment period of about five weeks, starts to decline after eight weeks onward and then stabilizes. It should therefore be pointed out that appropriate guidance is required for this initial work period.
    Download PDF (1088K)
  • Kenji OKABE
    Type: Article
    2005 Volume 56 Issue 5 Pages 394-409
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    The traditional type of simulation offers only a list of figures calculated by a simulation operation. Visual simulation demonstrates to the expert (user) of the simulation subject how the simulated action works. From the visually displayed simulation process, the expert is able to observe the problem deeply and think out the solution by observing the simulation procedure. However, visual simulation software currently on the market is sophisticated, high-cost and requires users to undergo training. This paper presents easy-to-use visual simulation techniques using the Excel spreadsheet and its' VBA programming facility. Visual simulation using an Excel sheet is useful for the office worker for his/her own job. In addition an agent-technique which realizes the autonomous behavior of an object within the spreadsheet is introduced in this paper. The spreadsheet is originally designed for business tables and graphs. This study suggests the spreadsheet for object moving visual simulation. Various simulation model examples which are prepared by Excel simulation techniques using the agent function are reported in this paper. These examples are used for evaluating the proposed technique.
    Download PDF (2034K)
  • Type: Appendix
    2005 Volume 56 Issue 5 Pages 410-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (55K)
  • Type: Appendix
    2005 Volume 56 Issue 5 Pages App23-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (69K)
  • Type: Appendix
    2005 Volume 56 Issue 5 Pages App24-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (69K)
  • Type: Appendix
    2005 Volume 56 Issue 5 Pages App25-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (69K)
  • Type: Appendix
    2005 Volume 56 Issue 5 Pages App26-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (69K)
  • Type: Appendix
    2005 Volume 56 Issue 5 Pages App27-
    Published: December 15, 2005
    Released: November 01, 2017
    JOURNALS FREE ACCESS
    Download PDF (69K)
feedback
Top