• Title/Summary/Keyword: Job-Shop

Search Result 273, Processing Time 0.029 seconds

A Flexible Branch and Bound Method for the Job Shop Scheduling Problem

  • Morikawa, Katsumi;Takahashi, Katsuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.4
    • /
    • pp.239-246
    • /
    • 2009
  • This paper deals with the makespan minimization problem of job shops. The problem is known as one of hard problems to optimize, and therefore, many heuristic methods have been proposed by many researchers. The aim of this study is also to propose a heuristic scheduling method for the problem. However, the difference between the proposed method and many other heuristics is that the proposed method is based on depth-first branch and bound, and thus it is possible to find an optimal solution at least in principle. To accelerate the search, when a node is judged hopeless in the search tree, the proposed flexible branch and bound method can indicate a higher backtracking node. The unexplored nodes are stored and may be explored later to realize the strict optimization. Two methods are proposed to generate the backtracking point based on the critical path of the current best feasible schedule, and the minimum lower bound for the makespan in the unexplored sub-problems. Schedules are generated based on Giffler and Thompson's active schedule generation algorithm. Acceleration of the search by the flexible branch and bound is confirmed by numerical experiment.

Minimizing Total Flow Time for Multiple Parts and Assembly Flow Shop (복수의 부품 및 조립 흐름공정의 총흐름시간 최소화)

  • Moon, Gee-Ju;Lee, Jae-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.4
    • /
    • pp.82-88
    • /
    • 2011
  • A typical job sequencing problem is studied in this research to improve productivities in manufacturing companies. The problem consists of two-stage parts and assembly processes. Two parts are provided independently each other and then two sequential assembly processes are followed. A new heuristic is developed to solve the new type of sequencing problem. Initial solution is developed in the first stage and then the initial solution is improved in the second stage. In the first stage, a longer part manufacturing time for each job is selected between two, and then a sequence is determined by descending order of the times. This initial sequence is compared with Johnson's sequence obtained from 2-machine assembly times. Any mismatches are tried to switch as one possible alternative and completion time is calculated to determine whether to accept the new sequence or not to replace the current sequence. Searching process stops if no more improvement can be made.

Analysis of Manpower Demand in the Nail Art/Makeup Industry and Its Relationship with NCS Education and National Technical Qualification (네일미용·메이크업 산업체의 인력 요구분석과 NCS 교육, 국가기술자격과의 관계)

  • Boo, Aejin
    • Journal of Fashion Business
    • /
    • v.19 no.5
    • /
    • pp.188-198
    • /
    • 2015
  • This study analyzed the qualifications necessary and manpower required in the Jeju nail art and make-up industry. We aimed to investigate the relationship between NCS education and national technical qualifications. For this study, 164 participants were given a questionnaire, and the collected data were analyzed via frequency analysis and multiple regression analysis using SPSS Ver. 18.0. The results of this study are as follows: 1. Matching job seekers with available positions was more difficult in nail art businesses than in makeup businesses. The main routes by which practitioners found jobs were Internet job sites and acquaintances. In addition, experience was the first consideration in hiring employees. 2. Those in high positions had less intention of employing students who had received NCS education, than those in lower positions. Intention to employ NCS graduates was high in businesses that found their employees through Internet job sites, vocational training institutes, acquaintances, or colleagues. Nail art workers prioritized NCS educational units in the following order: nail care, nail shop hygiene, gel nails, cosmetic nail removal, and tips/wraps. Makeup workers had the following priorities: basic makeup, wedding makeup, makeup shop safety, and hygiene management. They also mentioned basic occupational skills such as communication skills, interpersonal skills, and problem solving skills. Moreover, the new national licensing system was found to reflect competency in the most important skill sets.

자동차 ALC에 대응하는 Job Shop의 동기화 생산시스템에 관한 연구

  • 권보식;김경섭
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1997.04a
    • /
    • pp.100-100
    • /
    • 1997
  • 본 연구에서는 우리 자동차산업이 직면한 총체적인 위기상황을 극복하기 위한 방 안으로, 자동차 생산방식의 변혁, 인적자원관리의 혁신을 통한 생산성 제고, 독자 기술개발 능력의 조기확보, 효율적인 부품조달체제의 형성 등 산업전반에 걸친 혁신으로, 내적인 경 쟁력을 축적함과 동시에, 지역주의화의 진전에 따른 수출 여건의 악화를 극복하기 위해 선 진권 및 개발도상국으로의 현지화 노력이 적극적으로 추진되지 않으면 안될, 중대한 시점에 와 있다고 진단하면서, 본 연구의 목적을, 생산현장을 중심으로 한 내적 경쟁력 확보로 정 의하고, 그 실현방안으로서, 급변하는 시장환경에 적극 대응하기 위한 생산방식의 도입과, 이를 지원하는 생산정보시스템의 구축 모델을 제시하고자 한다. 첫 번째는, 변화가 급격한 시장환경에 적극 대응하는 생산방식의 도입으로, 철저한 낭비 배제 사상 - 생산현장의 낭비 소요를 배제(개선)하는 것만이 아니라 배제하고 바로 체계를 바꾸어 (개혁) 원래의 상태로 되돌아가지 않도록 하는 -을 기본으로, 정보, 관리, 생산, 제품, 물류 등에 관련된 손실 비 용을 감축시킴으로서 원가를 낮추고, 고객이 요구하는 다양하고, 좋은 품질이 제품을 신속 히 공급할 수 있는 체계를 갖추는 것이다. 이러한 낭비 배제 사상은 생산현장에서 필요한 것을, 필요한 때에, 필요한 만큼 만들고 운반하며 전달하는 관리 개선 등을 의미하며, 이것 을 적은 인원 및 설비로 최대한 빨리 (리드 타임의 단축), 계획대로 수행하도록 하는 것이 동기화 생산방식이다. 따라서, 본 연구에서는 자동차 생산공정 중 주 조립공정의 ALC(Assembly Line Control)에 대응하여, 선행 공정으로서 부품을 공급하는 Job Shop의 동기화 생산방식을 실제 적용한 사례 중심으로 전개하고자 한다. 두 번째의 접근방식은, 동 기화 생산방식에 컴퓨터 통합생산 (CIM, Computer Integrated Manufacturing)의 기술을 구 현, 적용하는 것이다. 즉, 동기화 생산 시스템 (SPS, Syncronized Production Sytem)을 구 축하는 것인데, 이것은 최신의 컴퓨터 기술을 생산현장에 적용함으로써 새로운 생산방식의 혁신에 버금가는 기술혁신이라 할 수 있을 것이다. 따라서, 이러한 접근은 컴퓨터 및 통신 기술의 눈부신 발전을 기초로 가능해진 것인데, 제조업에서의 심각한 고비용, 저효율 문제 를 해결하기 위해 필수적으로 도입해야만 하는 실정이다. 또한 소비자의 다양한 요구로 인 하여 제품의 종류와 사양면에서 심한 변동을 보이는 시장 수요에, 신속한 정보처리로 대응 하는데도 크게 기여하고 있다. 이에 본 연구에서는, 자동차 Job Shop의 동기화 생산방식을 지원하는 동기화 생산시스템의 구축 모델을 제시하고자 한다.

  • PDF

An Evaluation of Workload Limited Order Release Strategies considering Planning Stage in a Job Shop (생산계획 단계를 고려한 Job Shop 환경에서 Order Release 정책의 유효성에 관한 연구)

  • 최병대
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.04a
    • /
    • pp.194-198
    • /
    • 1999
  • Order Review/Release(ORR) 시스템은 생산계획 시스템과 작업현장간의 연결고리로서, 작업현장으로의 작업투입을 조절하여 작업현장에서의 체류시간과 공정중재고, 리드타임의 변동을 줄여주는 역할을 한다. 그러나, 지금까지의 ORR에 관한 연구들은 ORR의 유효성에 관하여 명확한 결론을 내지 못하고 있다. 일부는 ORR이 작업의 전체 리드타임을 증가시키는 악영향이 있음을 주장하고, 일부는 ORR을 도입함으로써 작업현장에서의 리드타임과 공정중재고가 줄어들고, 안정화될 수 있다고 주장한다. 본 연구는 어떠한 환경에서 Order Release 정책을 도입하는 것이 시스템의 성능향상에 기여할 수 있는 지 확인하는 것을 목적으로 하고, 가상의 Job Shop을 대상으로 시뮬레이션을 수행하였다. 작업장가동률 수준과 생산계획 단계에서의 계획오더 이송간격을 환경분수로 설정하고, 작업현장의 부하를 고려하여 작업투입을 통제하는 다섯 가지 Order Release 정책과 세 가지 우선순위 규칙을 적용하여 실험하였으며, 리드타임, 납기, 공정중재고 등과 관련된 8가지 척도에 대해 각 정책을 평가하였다. 그리고, 계획시스템의 부하평준화 기능이 존재할 때, Order Release 정책의 도입으로 인한 효과가 더 크다는 기존의 연구결과를 검증하기 위해, 부하평준화를 적용하였을 때 Order Release를 통제하지 않는 정책과 통제하는 정책간의 성능향상 차이가 있는지를 확인하는 실험을 수행하였다. 실험결과, ORR 보다는 우선순위규칙이 시스템의 성능을 결정하는 주요 통제정책으로 밝혀졌다. 그러나, 생산계획시스템에서 1주 간격으로 계획오더를 이송할 때는 Order Release 방법을 적용하여 작업현장에서의 평균 리드타임과 리드타임의 변동, 공정중재고가 줄어드는 결과를 보였고, 가동률 수준이 높을수록 ORR 방법간의 차이가 크게 나타났다. 그리고 부하평준화 기능은 Order Release 정책의 유효성에 별 영향을 주지 않는 것으로 나타났다. 결론적으로, Order Release 방법은 우선순위규칙간의 성능차이를 줄이거나, 대체할 수 통제 기법이라기보다는 우선순위규칙을 보완하여 공정중재고와 작업현장에서의 리드타임, 리드타임의 편차를 줄여주는 역할을 한다고 볼 수 있다. 그리고, 계획시스템이 존재하여 계획오더가 일정기간간격으로 이송되는 환경에서 특히 유용하다는 결론을 얻었다.

  • PDF

A Study on Determining Job Sequence by Sampling Method (II) (샘플링 기법에 의한 작업순서의 결정 (II))

  • 강성수;노인규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.12 no.19
    • /
    • pp.25-30
    • /
    • 1989
  • This study is concerned with a job sequencing method using the concept of sampling technique. This sampling technique has never been applied to develop the scheduling algorithms. The most job sequencing algorithms have been developed to determine the best or good solution under the special conditions. Thus, it is not only very difficult, but also taken too much time to develop the appropriate job schedules that satisfy the complex work conditions. The application areas of these algorithms are also very narrow. Under these circumstances it is very desirable to develop a simple job sequencing method which can produce the good solution with the short tine period under any complex work conditions. It is called a sampling job sequencing method in this study. This study is to examine the selection of the good job sequence of 1%-5% upper group by the sampling method. The result shows that there is the set of 0.5%-5% job sequence group which has to same amount of performance measure with the optimal job sequence in the case of experiment of 2/n/F/F max. This indicates that the sampling job sequencing method is a useful job sequencing method to find the optimal or good job sequence with a little effort and time consuming. The results of ANOVA show that the two factors, number of jobs and the range of processing time are the significant factors for determining the job sequence at $\alpha$=0.01. This study is extended to 3 machines to machines job shop problems further.

  • PDF

A Dynamic Dispatching Method to Improve Performance of Flow shop (Flow shop의 효율제고를 위한 동적 작업배정방안)

  • Rhee, Jong-Tae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.4
    • /
    • pp.37-50
    • /
    • 1994
  • The efficiency of production system is mainly considered in the viewpoints of reducing the average flow time of products and increasing the throughput rate. The performance in these viewpoints is very depending on job dispatching of each machine in real time operation, in the case jobs are released dynamically. In this research, a heuristic dynamic dispatching method is suggested for a flow shop case where new jobs with random process times are released by an interarrival time distribution and the number of waiting jobs between each pair of machines are limited. The proposed method has been compared with some priority rule-based dispatching methods by simulation and found to be superior to them.

  • PDF

A Decision Support System for Machining Shop Control (가공 Shop의 제어를 위한 의사결정지원 시스템)

  • Park, Hong-Seok;Seo, Yoon-Ho
    • IE interfaces
    • /
    • v.13 no.1
    • /
    • pp.92-99
    • /
    • 2000
  • Conflicts and interruptions caused by resource failures and rush orders require a nonlinear dynamic production management. Generally the PP&C systems used in industry presently do not meet these requirements because of their rigid concepts. Starting with the grasp of the disadvantages of current approaches, this paper presents a control structure that enables system to react to various malfunctions using a planning tolerance concept. Also, production processes are modeled by using Fuzzy-Petri-Net modeling tool in other to handle the complexity of job allocation and the existence of many disparities. On the basis of this model the developed system support the short-term shop control by rule based decision.

  • PDF

A Study on Flow Shop Scheduling Problems under Fuzzy Environment (퍼지 환경하에서의 FLOW SHOP 일정계획 방법에 관한 연구)

  • 김정자;이상완;박병주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.2
    • /
    • pp.163-163
    • /
    • 1988
  • This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

A study on flow shop scheduling problems under fuzzy environment (퍼지 환경하에서의 flow shop 일정계획 방법에 관한 연구)

  • 김정자;이상완;박병주
    • Korean Management Science Review
    • /
    • v.13 no.2
    • /
    • pp.163-175
    • /
    • 1996
  • This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

  • PDF