• Title/Summary/Keyword: Job-Shop

Search Result 274, Processing Time 0.022 seconds

A strategic operating model of AGVs in a flexible machining and assembly system (유연가공 및 조립시스템에서의 AGV 운용전략)

  • 양대용;정병희;윤창원
    • Korean Management Science Review
    • /
    • v.11 no.1
    • /
    • pp.23-37
    • /
    • 1994
  • This paper discusses the methodology for the operational performance of unit-load automated guided vehicles(AGVs) in a flow-shop-type flexible machining and assembly systems (FM/AS). Throughout the paper, AGVs are working as a carrier and mobile workstation. For a double-loop FM/AS, in which one loop is dedicated to machining and the other to assembly, three AGV operating strategies are proposed. Considering the entering interval and travel time of AGVs between workcenters, the strategies are developed to determine the best job sequence which minimizes the makespan and vehicle idle time. Entering times of AGVs and the required minimum number of AGVs are obtained on the basis of the best job sequence. When the number of AGVs are limited, entering times of AGVs are adjusted to maximize the utilization of AGVs.

  • PDF

Minimizing Total Completion Times in a Two-machine Flowshop Scheduling with Outsourcing Strategy allowed (아웃소싱 전략을 활용하는 두 단계 흐름생산라인에서 완료시간의 총합을 최소화하는 일정계획문제)

  • Yoo, Jaewook;Lee, Ik Sun
    • Korean Management Science Review
    • /
    • v.33 no.2
    • /
    • pp.1-10
    • /
    • 2016
  • We treats a job scheduling in a 2-machine flow-shop problem with outsourcing strategy allowed. Jobs in the first machine are processed in-house or outsourced to the other companies. In this paper, all the considered jobs are determined to be in-house processed or outsourced. When a job is outsourced, then the firm should pay an outsourcing cost additionally. We want to minimize the sum of the outsourcing costs and the total completion times of finished jobs. In this paper, some solution properties are characterized, and then some heuristic algorithms and a branch-and-bound solution algorithm are derived. This paper evaluates finally the performance of the proposed algorithms during the numerical tests.

A Load Balancing Problem among Operators in a Nonidentical Parallel Machine Shop Considering Operator Sharing (작업자 공유가 가능한 이기종 병렬기계 작업장에서 작업자 부하균형 문제)

  • 문덕희;김대경
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.51
    • /
    • pp.41-52
    • /
    • 1999
  • In this paper, a load balancing problem among operators is considered, when one or more machines can be assigned to an operator. The machines are grouped into two types and there are more than one machines in each group. The type of machine in which a job can be processed, is determined. However, an operator can handle both types of machine. The elementary operations of a job are classified into three classes : machine-controlled elements, operator-controlled elements and machine/operator- controlled elements. The objective is to balance the workloads among operators under the constraints of available machine-time and operator-time. A heuristic solution procedure is suggested for allocating jobs to machines and allocating machines to operators. The performance of the algorithm is evaluated with various data set.

  • PDF

Suggestions for Improvement of Industrial High School Education Based on the Value of Competency-Based Education (능력 중심 교육의 가치가 공업계 고등학교 교육의 운영 개선에 주는 시사점)

  • Kim, Hee-Pil
    • 대한공업교육학회지
    • /
    • v.30 no.2
    • /
    • pp.33-44
    • /
    • 2005
  • The purpose of this study is to suggest plans to improve the industrial high school through the inquiry of Competency-Based Education(CBE). The suggestions are as followings: (1) Selection and organization of the educational contents of industrial high school must be based on job analysis. (2) Instructional objectives must be defined as a performance objective and enabling objectives. (3) Instruction must be individualized in method, the instructional contents must be organized in the unit of module. (4) Evaluation system must be not knowledge based but performance-based. (5) Physical Environment of work shop must be organized based on facilities, equipments and machines abstracted by job analysis. (6) Competency-Based Teacher Education(CBTE) program is required to train competent teachers in practice.

Material Handling System Improvement Analysis Applying Simulation Technique (시뮬레이션 기법(技法)을 이용한 물류(物流) 시스템 개선(改善)에 관한 연구(硏究))

  • Shin, Hyeon-Pio;Park, Sung-Yeon;Lee, Hwa-Ki
    • IE interfaces
    • /
    • v.5 no.1
    • /
    • pp.35-46
    • /
    • 1992
  • This paper deals with analysis of material handling system efficiency of a heat-exchanger manufacturing line. This line is a typical flow shop type assembly line which consists of 10 steps of assembly stations. Each station have one or two workers who assemble and move components for the job, and no special transporters for component's movement. Therfore, all the workers are involoved in unnecessary moving activities which decrease overall production efficiencies of the line. To improve productivities, production outputs and worker's job performances for this assembly line, the several alternatives are considered such as installing new conveyor lines and automatic guided vehicle(AGV) system. Analyzing economic feasibilities and responses of the system alternatives, an experimental simulation model is built suing SIMAN Ver. 3. 5 simulation language with CINEMA package for animation of the process flow. Through this animation process a vivid picturial analysis could performed on the process flow.

  • PDF

A Study on the Dynamic Scheduling for Distributed Management Systems (분산관리 시스템을 위한 동적 스케쥴링의 연구)

  • Chung, Nam-Kee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.2
    • /
    • pp.207-216
    • /
    • 1995
  • Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

  • PDF

Influence of the Job Performance upon the Hair beautician's Job Satisfaction (헤어미용인의 직무만족이 직무성과에 미치는 영향)

  • Bang, Hee-Bong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.12
    • /
    • pp.8585-8595
    • /
    • 2015
  • This study was implemented to amass and analyze the data from 500 Seoul district beauty shop workers, which came from the use of the SPSS18.0. The statistical analysis was conducted through frequency for demographic characteristics, validity for factors analysis by using Varimax rotation, and reliability for Cronbach's alpha coefficient.. Also, the analysis was once again analyzed through the Pearson correlation coefficient, where our hypothesis was proven through regression analysis. Our research results have shown that, first, job satisfaction and job performance differed over matters like gender, age, education level, employment conditions, job category, overall work experience, daily work hours, and monthly income. Second, job satisfaction was shown to have a significant influence on job performance, where higher job satisfaction levels led to higher job performance. Thus, job satisfaction was a great factor to increase job performance by fulfilling their needs level. Also, they would act more positive and future-oriented when they have special needs like motivate achievement, wage, promotion, and reward. Therefore, managerial staff should continually develop any programs in order to upgrade beautician's job performance through their job satisfaction.

A Solution of Production Scheduling Problem adapting Fast Model of Parallel Heuristics (병렬 휴리스틱법의 고속화모델을 적용한 생산 스케쥴링 문제의 해법)

  • Hong, Seong-Chan;Jo, Byeong-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.959-968
    • /
    • 1999
  • several papers have reported that parallel heuristics or hybrid approaches combining several heuristics can get better results. However, the parallelization and hybridization of any search methods on the single CPU type computer need enormous computation time. that case, we need more elegant combination method. For this purpose, we propose Fast Model of Parallel Heuristics(FMPH). FMPH is based on the island model of parallel genetic algorithms and takes local search to the elite solution obtained form each island(sub group). In this paper we introduce how can we adapt FMPH to the job-shop scheduling problem notorious as the most difficult NP-hard problem and report the excellent results of several famous benchmark problems.

  • PDF

Simulation of Efficient Flow Control for FAB of Semiconductor Manufacturing (반도체 FAB 공정에서의 효율적 흐름제어를 위한 시뮬레이션)

  • 한영신;전동훈
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.407-415
    • /
    • 2000
  • The ultimate goal of flow control in the semiconductor fabrication process, one of the most equipment-intensive and complex manufacturing process, is to reduce lead time and work in process. In this paper, we propose stand alone layout in the form of job shop using group technology to improve the Productivity and eliminate the inefficiency in FMS (flexible manufacture system). The performance of stand alone layout and in-line layout are analyzed and compared while varying number of device variable chanties. The analysis of in-line layout is obtained by examining its adoption in the memory products of semiconductor factory. The comparison is performed through simulation using ProSys; a window 95 based discrete system simulation software, as a tool for comparing performance of two proposed layouts. The comparison demonstrates that when the number of device variable change is small, in-line layout is more efficient in terms of production Quantity. However, as the number of device variable change is more than 14 times, stand alone layout prevails over in-line layout.

  • PDF

Solving the test resource allocation using variable group genetic algorithm (가변 그룹 유전자알고리즘 기반의 시험자원할당 문제 해결)

  • Mun, Chang-min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.8
    • /
    • pp.1415-1421
    • /
    • 2016
  • There are considerable concern on the methods for the efficient utilization of the test-resources as increasing of the number of the tests for functionality and performance verification of weapon systems. Furthermore, with an increase in the complexity of the resource assignment the decision support is required. Test resource allocation is basically the same problems as conventional NP-hard FJSP(Flexible Job Shop Problem), therefore empirical test resource allocation method that has been used in many decades is limited in the time performance. Although research has been conducted applying the genetic algorithm to the FJSP, it is limited in the test resource allocation domain in which more than one machine is necessary for a single operation. In this paper, a variable group genetic algorithm is proposed. The algorithm is expected to improve the test plan efficiency by automating and optimizing the existing manual based allocation. The simulation result shows that the algorithm could be applicable to the test plan.