• Title/Summary/Keyword: Job-Shop

Search Result 273, Processing Time 0.023 seconds

Conveyor Capability Simulation for Semiconductor Diffusion Area (반도체 확산공정에서의 컨베이어 적정속도와 길이를 구하는 시뮬레이션)

  • 박일석;이칠기
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.3
    • /
    • pp.59-65
    • /
    • 2002
  • Semiconductor wafer fabrication is a business of high capital investment and fast changing nature. To be competitive, the production in a fab needs to be effectively planned and scheduled starting from the ramping up phase, so that the business goals such as on-time delivery, high output volume and effective use of capital intensive equipment can be achieved. Project executed that use conveyor in bay semiconductor A line. But conveyor capability is lacking and rundown happened in equipment. Do design without normal simulation and conveyor system failed. The comparison is peformed through simulation using .AutoMod a window 98 based discrete system simulation software, as a tool for comparing performance of proposed layouts. In this research estimate optimum conveyor capability, there is the purpose.

  • PDF

Minimizing Weighted Tardiness using Decomposition Method (분할법을 이용한 가중납기지연 최소화 문제)

  • Byeon, Eui-Seok;Hong, Sung-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.1
    • /
    • pp.109-115
    • /
    • 2006
  • Exact solutions for practical-size problems in job shop will be highly inefficient. Scheduling heuristics, therefore, are typically found in the literature. If we consider real-life situations such as machine breakdowns, the existing scheduling methods will be even more limited. Scheduling against due-dates addresses one of the most critical issues in modern manufacturing systems. In this paper, the method for weighted tardiness schedule using a graph theoretic decomposition heuristic is presented. It outstands the efficiency of computation as well as the robustness of the schedule.

Fiber Laser Welding in the Car Body Shop - Laser Seam Stepper versus Remote Laser Welding -

  • Kessler, Berthold
    • Journal of Welding and Joining
    • /
    • v.31 no.4
    • /
    • pp.17-22
    • /
    • 2013
  • The excellent beam quality of high power fiber lasers are commonly used for remote welding applications in body job applications. The Welding speed and productivity is unmatched with any other welding technology including resistance spot welding or traditional laser welding. High tooling cost for clamping and bulky safety enclosures are obstacles which are limiting the use. With the newly developed Laser stitch welding gun we have an integrated clamping in the process tool and the laser welding is shielded in a way that no external enclosure is needed. Operation of this laser welding gun is comparable with resistance spot welding but 2-times faster. Laser stitch welding is faster than spot welding and slower than remote welding. It is a laser welding tool with all the laser benefits like welding of short flanges, weld ability of Ultra High Strength steel, 3 layers welding and Aluminium welding. Together with low energy consumption and minimum operation cost of IPG fiber laser it is a new and sharp tool for economic car body assembly.

Cellular manufacturing system design with proper assignment of machines and parts

  • Won Yu Gyeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.390-396
    • /
    • 2002
  • This study is concerned with the strict machine-cell and part-family grouping (MCPFG) in cellular manufacturing system design. Most of MCPFG methodologies often suffer from improper assignment of machines and parts in which exceptional machine has more common operations with machines in a cell other than its own cell and exceptional part has more operations through machines in a cell other than the cell corresponding to its own family. This results in the loss of similarity in part design or common setup of machines and the benefits from the conversion of job shop manufacturing into cellular manufacturing are lost. In this study, a two-phase methodology is proposed to find the machine-cells and part families under the strict constraints in which all machines and parts are assigned to its most proper cells and families. Test results with moderately medium-sized ill-structured MCPFG problems available from the literature show the substantial efficiency of the proposed approach.

  • PDF

An Efficient Buffer Management in a Multi-Cell Flexible Manufacturing Systems (FMS 환경하의 효율적인 버버관리에 관한 연구)

  • 이정표
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.10a
    • /
    • pp.128-132
    • /
    • 1998
  • This research is concerned with buffer management in a multi-cell FMS(Flexible Manufacturing System) with an AGVS(Automated Guided Vehicle System). To reduce blocking and starving caused by breakdowns, variablility in process times, and diversity of part routing, buffer is needed. Due to the high per unit buffer cost, which primarily consists of floor space and equipment cost, the total capacity of buffers in an FMS is very limited. Therefore, proper buffer management can provide a high system efficiency. This paper presents a buffer management model for a multi-cell FMS with an AGVS and a simulation study to compare the proposed model to a conventional buffer management model in a job shop FMS.

  • PDF

A SIMULATION/OPTIMIZATION ALGORITHM FOR AN FMS DISPATCHING PRIORITY PROBLEM

  • Lee, Keun-Hyung;Morito, Susumu
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1993.10a
    • /
    • pp.16-16
    • /
    • 1993
  • The efficient use of capital intensive FMS requires determination of effective dispatching priority with which the parts of the selected part types are to be inputed into the system. This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS, Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness, Computational performance of the algorithm shows that good solutions can be obtained within a reasonable amount of computations. The paper also compares the performance of the "optimal" or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules such as SPT, EDD and SLACK.

  • PDF

Modified Genetic Operators for the TSP

  • Soak Sang Moon;Yang Yeon Mo;Lee Hong Girl;Ahn Byung Ha
    • Journal of Navigation and Port Research
    • /
    • v.29 no.2
    • /
    • pp.141-146
    • /
    • 2005
  • For a long time, genetic algorithms have been recognized as a new method to solve difficult and complex problems and the performance of genetic algorithms depends on genetic operators, especially crossover operator. Various problems like the traveling salesman problem, the transportation problem or the job shop problem, in logistics engineering can be modeled as a sequencing problem This paper proposes modified genetic crossover operators to be used at various sequencing problems and uses the traveling salesman problem to be applied to a real world problem like the delivery problem and the vehicle routing problem as a benchmark problem Because the proposed operators use parental information as well as network information, they could show better efficiency in performance and computation time than conventional operators.

An AGV control policy reflecting the current and future status information of a semiconductor and LCD production shop (반도체 및 LCD 생산시스템에서 현재 및 미래의 상태 정보를 활용한 AGV 운영 전략)

  • Suh, Jung-Dae;Jang, Jae-Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.3
    • /
    • pp.238-248
    • /
    • 2000
  • Facilities are getting more automated and informative in modern manufacturing systems, especially in semiconductor and LCD plants. These systems keep a great deal of such information on its current and near-future status as the arrival time and job completion time of their parts. This paper presents an efficient policy for AGV and part routing using information on the future status of the system where AGVs are playing a central role for material handling. Efficient control of AGVs is very important because AGV systems often become the bottleneck and limit the total production capacity of a very expensive plant. The cell controller records the future events chronologically in Next Event Schedule, and uses this list to determine to which place the AGVs and parts to be sent.

  • PDF

Virtual System Buffer Model in Flexible Manufacturing Systems with an AGV System (AGVS를 포함한 FMS에서의 가상 시스템버퍼 모델에 관한 연구)

  • Kyung Sup Kim
    • Journal of the Korea Society for Simulation
    • /
    • v.7 no.2
    • /
    • pp.45-62
    • /
    • 1998
  • This research is concerned with buffer management in a multi-cell FMS with an AGVS. Buffers in manufacturing systems are required to reduce blocking and starving caused by breakdowns, variability in process times, and diversity of part routing. Due to the high per unit buffer cost, which primarily consists of floor space and equipment costs, the total capacity of buffers in and FMS is very limited. Proper buffer management can provide a high system efficiency. This paper presents a buffer management model for a multi-cell FMS with an AGVS and a simulation study to compare the proposed model to a conventional buffer management model in a job shop FMS.

  • PDF

A Load Balancing Problem in a Parallel Machine Shop Considering Operator Sharing (작업자 공유가 가능한 병렬기계작업장에서 작업자 부하 균형을 고려한 작업할당문제)

  • Moon, Dug-Hee;Kim, Dae-Kyoung
    • IE interfaces
    • /
    • v.12 no.2
    • /
    • pp.166-173
    • /
    • 1999
  • In this paper, a load balancing problem among operators is considered, when one or more identical machines can be assigned to an operator. The operations of a job are separated into three categories : machine-controlled elements, operator-controlled elements and machine/operator-controlled elements. Machining or forming operations are included into the first category. The second category includes inspection and moving to another machine, and the last category includes setup and loading/unloading operation. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A hierarchical heuristic solution procedure is suggested for allocating jobs to each machine and allocating machines to each operator. The performance of the algorithm is evaluated with various data set.

  • PDF