• 제목/요약/키워드: multi-shop

검색결과 126건 처리시간 0.021초

공정납기를 이용한 jop shop 일정계획의 발견적 기법 (A heuristic technique for jop shop scheduling using operation due dates)

  • 배상윤;김여근;김영균
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.46-49
    • /
    • 1996
  • This paper presents a multi-pass heuristic for job shop scheduling with due dates. The proposed heuristic iteratively improves solutions based on operation due dates. To find a good solution efficiently, a method for searching the neighborhood of current schedule is developed. The heuristic is compared with two existing heuristics as well as several dispatching rules in terms of solution quality and computation time. The experimental results show that the proposed approach is promising.

  • PDF

수정된 다기준 의사결정을 이용한 흐름방식에서의 작업순서 결정 (Job sequencing decision in flow shop using revised Multi-Criteria Decision Making Method)

  • 안춘수;강태건;정상윤;홍성일
    • 산업경영시스템학회지
    • /
    • 제20권44호
    • /
    • pp.135-151
    • /
    • 1997
  • In this paper, we propose a simple and relatively efficient heuristic method to determine job sequencing in the flow-shop considering multiple criteria such as processing time, due date and cost. The proposed method is applicable to the flow- shop where the jobs are released simultaneously and their processing sequence is predetermined and not changed until the whole jobs are processed. To develop this method, we mixed and modified some well-known multi-attribute decision heuristics such as the simple linear weighting scheme, the lexicographic rule and the 'elimination by aspect' rule. Some computer simulations were conducted to test the efficiency of the proposed method and it has been compared with the SWPT (Shortest Working Processing Time) rule and EDD (Earliest Due Date) rule. The results show that our method is as effective as the traditional ones in terms of mean flow time, tardiness, makespan, cycle time, machine utilization, etc., and proved to be much simpler and more flexible to be used in real situations.

  • PDF

생산제어시스템의 시뮬레이션모델 자동생성

  • 이상훈;조현보;정무영
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.631-634
    • /
    • 1996
  • This paper describes an intelligent user interface to define simulation models from the process and resource models. It also explains an automatic program generator of discrete event simulation model for shop floor control in a flexible manufacturing system. Especially, the paper is focused on the design and development of methodology to automate simulation modeling from the system description. Describing a shop floor control system in simulation is not an easy task since it must resolve various decision problems such as deadlock resolution, part dispatching, resource conflict resolution, etc. The program generator should be capable of constructing a complete discrete simulation models for a multi-product and multi-stage flow shop containing the above mentioned problems.

  • PDF

N$\times$3 Flow-shop 문제에 대한 수정된 발견적기법 분석과 기존기법과의 비교연구 (The Corrective Heuristic Algorithm Analysis of the N$\times$3 Flow-shop Problem and Comparative Study with Multi-model)

  • 강석호;궁광호
    • 한국경영과학회지
    • /
    • 제6권2호
    • /
    • pp.13-19
    • /
    • 1981
  • This paper developed 3 flow-shop sequencing heuristic methods: modified RA method, modified RACS method and modified RAES method. These methods modified RA method, RACS method and RAES method developed by D. G. Dannenbring. These methods can easily determine desirable sequence of orders and can improve nx3 flow-shop's productivity and efficiency. The maximum flow-time criterion is selected as the evaluation criterion of flow-shop's efficiency, We evaluated these 6 heuristic methods’ performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow-time than the original methods.

  • PDF

포항 Grand M Hotel, 리노베이션 계획안 (Grand M Hotel interior renovation)

  • 김혜자
    • 한국실내디자인학회:학술대회논문집
    • /
    • 한국실내디자인학회 2006년도 춘계학술발표대회 논문집
    • /
    • pp.97-98
    • /
    • 2006
  • This study proposes a method of generating steel house shop drawing in an automated design method, reducing construction manpower and period. With one hour fire-resistant approval code, reflecting work ability and efficiency, steel-framed house market is expected to extend from one or two story house to multi-purpose facilities up to four story height. More models have been constructed in this system than the first appearance of fire-resistant approval in Korea in 1997 Also, cost estimation of components such as frame walls, roof trusses and floors is obtained with shop drawings. Also, the lack of suppliers of steel framed house shop drawing and unstandardized drawing method get constructors have difficulty in understanding its design. In steel framed house industry, shop drawings are essential part in building and constructing framework and they have major effects on construction deadlines and expenses. By exploring method of shop drawing automation, this study aims to optimize work flow with a standardized drawing method. The proposed system can be applied to manufacturing automation in domestic industry of factory-built panelizing method in the near future.

  • PDF

신경망 모델 기반 조선소 조립공장 작업상태 판별 알고리즘 (Neural Network Model-based Algorithm for Identifying Job Status in Block Assembly Shop for Shipbuilding)

  • 홍승택;최진영;박상철
    • 산업공학
    • /
    • 제24권3호
    • /
    • pp.267-273
    • /
    • 2011
  • In the shipbuilding industry, since production processes are so complicated that the data collection for decision making cannot be fully automated, most of production planning and controls are based on the information provided only by field workers. Therefore, without sufficient information it is very difficult to manage the whole production process efficiently. Job status is one of the most important information used for evaluating the remaining processing time in production control, specifically, in block assembly shop. Currently, it is checked by a production manager manually and production planning is modified based on that information, which might cause a delay in production control, resulting in performance degradation. Motivated by these remarks, in this paper we propose an efficient algorithm for identifying job status in block assembly shop for shipbuilding. The algorithm is based on the multi-layer perceptron neural network model using two key factors for input parameters. We showed the superiority of the algorithm by using a numerical experiment, based on real data collected from block assembly shop.

패션전문점 소비자의 쇼핑성향과 점포평가기준에 대한 연구 (A Study on Shopping Orientationss and Store Evaluative Criteria of Fashion Specialty Store Consumer)

  • 김귀연;이경희
    • 한국의류학회지
    • /
    • 제22권7호
    • /
    • pp.920-930
    • /
    • 1998
  • The purpose of this study are to investigate the consumer characteristics of fashion specialty store and compare them among different fashion specialty store types. Based on the results, patronage profiles for multi brand shop, maker total shop, mart brand shop, and oulet multi shop are develop, Marketing implications are discussed. Before empirical study, theoretical study was done through reviewing the existing litera-tures and a questionnaire was developed. Data(N=410) were collected via a questionnaire distributed to 469 female consumers who shopped at fashion specialty store in Pusan. The results were as follows ; 1) Factor analysis revealed seven factors of shopping orientations(Brand Conscious, Planning Purchase, Self-confidence in clothing shopping, Economy, Common Style in fashion, Individuality Seeking, and Passive Purchase), and seven factors of store evaluative criteria(Store Atmosphere, Assortment, Quality, Promotion, Price/Information, Sales Personnel, and Convenience). 2)By crosstabulation analysis with $\chi$2-test and multivariate analysis variance with sheff-test, consumer characteristics such as shopping orientations, store evaluative criteria, purchase behavior variables, and demo-graphic variables were significantly different among fashion specialty store types.

  • PDF

스틸하우스 설계 자동화의 필요성과 적용방법에 관한 연구 (Study on the Design Automation of Steel House Shop drawing)

  • 원완연;박현수
    • 한국실내디자인학회:학술대회논문집
    • /
    • 한국실내디자인학회 2006년도 춘계학술발표대회 논문집
    • /
    • pp.103-106
    • /
    • 2006
  • This study proposes a method of generating steel house shop drawing in an automated design method, reducing construction manpower and period. With one hour fire-resistant approval code, reflecting work ability and efficiency, steel-framed house market is expected to extend from one or two story house to multi-purpose facilities up to four story height. More models have been constructed in this system than the first appearance of fire-resistant approval in Korea in 1997. Also, cost estimation of components such as frame walls, roof trusses and floors is obtained with shop drawings. Also, the lack of suppliers of steel framed house shop drawing and unstandardized drawing method get constructors have difficulty in understanding its design. In steel framed house industry, shop drawings are essential part in building and constructing framework and they have major effects on construction deadlines and expenses. By exploring method of shop drawing automation, this study aims to optimize work flow with a standardized drawing method. The proposed system can be applied to manufacturing automation in domestic industry of factory-built panelizing method in the near future.

  • PDF

An Efficient PSO Algorithm for Finding Pareto-Frontier in Multi-Objective Job Shop Scheduling Problems

  • Wisittipanich, Warisa;Kachitvichyanukul, Voratas
    • Industrial Engineering and Management Systems
    • /
    • 제12권2호
    • /
    • pp.151-160
    • /
    • 2013
  • In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality non-dominated solutions.

비정체 로트 - 스트리밍 흐름공정 일정계획 (No-Wait Lot-Streaming Flow Shop Scheduling)

  • 윤석훈
    • 산업공학
    • /
    • 제17권2호
    • /
    • pp.242-248
    • /
    • 2004
  • Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.