scispace - formally typeset
Search or ask a question
Author

Katsundo Hitomi

Bio: Katsundo Hitomi is an academic researcher. The author has contributed to research in topics: Production engineering & Integrated Computer-Aided Manufacturing. The author has an hindex of 1, co-authored 1 publications receiving 145 citations.

Papers
More filters
Book
01 Jul 1996

145 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: A multilevel hierarchical control algorithm is proposed which involves a stochastic optimal control problem at the first level of the system and a computational scheme is described.
Abstract: The problem of production management for an automated manufacturing system is described. The system consists of machines that can perform a variety of tasks on a family of parts. The machines are unreliable, and the main difficulty the control system faces is to meet production requirements while the machines fail and are repaired at random times. A multilevel hierarchical control algorithm is proposed which involves a stochastic optimal control problem at the first level. Optimal production policies are characterized, and a computational scheme is described.

576 citations

Journal ArticleDOI
TL;DR: In this article, a manufacturing system design decomposition (MSDD) is proposed to enable a firm to simultaneously achieve cost, quality, delivery responsiveness to the customer, and flexibility objectives.

190 citations

Journal ArticleDOI
TL;DR: In this article, an optimization strategy was developed to determine the optimum cutting parameters for multipass milling operations like plain milling and face milling, based on the "maximum production rate" criterion and incorporating eight technological constraints.
Abstract: This paper outlines the development of an optimization strategy to determine the optimum cutting parameters for multipass milling operations like plain milling and face milling. The developed strategy is based on the “maximum production rate” criterion and incorporates eight technological constraints. The optimum number of passes is determined via dynamic programming, and the optimal values of the cutting conditions are found based on the objective function developed for the typified criterion by using a non-linear programming technique called “geometric programming”. This paper also underlies the importance of using optimization strategies rather than handbook recommendations as well as pointing out the superiority of the multipass over the single-pass optimization approach.

132 citations

Journal ArticleDOI
TL;DR: A novel line balancing problem that differs from assembly line balancing problems in that the operations of each workstation are partitioned into blocks of simultaneously executed (parallel) operations, based on a mixed-integer programming approach.
Abstract: A novel line balancing problem is considered. It differs from assembly line balancing problems in that the operations of each workstation are partitioned into blocks of simultaneously executed (parallel) operations. The blocks of each workstation are executed sequentially. For the line design stage considered in this paper, the compatibility (inclusion and exclusion) constraints for grouping operations into blocks and workstations as well as precedence constraints are known. The goal is to minimize a weighted sum of the number of workstations and the number of blocks while achieving a desired cycle time and satisfying all the constraints. The developed exact and heuristic methods are based on a mixed-integer programming approach. Experimental results are reported.

106 citations

Journal ArticleDOI
TL;DR: Two heuristic algorithms based on the COMSOAL technique are proposed to find the best assignment of operations to blocks and assignment of blocks to workstations that leads to the minimal transfer line cost.
Abstract: The paper deals with optimal balancing transfer lines where the operations in each workstation are grouped into blocks. All operations of the same block are executed simultaneously by one spindle head. Spindle heads of the same workstation are activated sequentially. The workstation time is the sum of the processing times of its blocks. The problem is to find the best assignment of operations to blocks and assignment of blocks to workstations that leads to the minimal transfer line cost (a weighted sum of blocks and workstation numbers). The solution must provide a desired productivity rate (cycle time). It must also satisfy precedence and compatibility constraints. Two heuristic algorithms based on the COMSOAL technique are proposed. Results from computer testing are reported.

84 citations