• Title/Summary/Keyword: 소일정계획

Search Result 3, Processing Time 0.016 seconds

Short-term Scheduling Optimization for Subassembly Line in Ship Production Using Simulated Annealing (시뮬레이티드 어닐링을 활용한 조선 소조립 라인 소일정계획 최적화)

  • Hwang, In-Hyuck;Noh, Jac-Kyou;Lee, Kwang-Kook;Shin, Jon-Gye
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.1
    • /
    • pp.73-82
    • /
    • 2010
  • Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

Development of load balancing for detail scheduling (소일정 계획 수립을 위한 부하조정과 알고리즘 개발에 관한 연구)

  • 김정자;공명달;김상천
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1997.10a
    • /
    • pp.158-161
    • /
    • 1997
  • 소일정 부하조정 방법에는 대상기간을 결정하여 대상기간에 속하는 공정들에 국한시켜 부하조정을 하는 방법과 현재 기준일을 설정후 현재기준일 이후에 속하는 전체 공정에 대하여 부하조정을 하는 방법이 있으며 이들은 각각 장단점을 가지고 있다. 본 연구에서는 전자의 경우에 대하여 고찰하였으며 특히 소일정 부하조정 루틴, 주요 처리 모듈 및 전제 조건 등에 대하여 구체적인 실례를 들어 분석, 고찰하였다.

  • PDF

A Study on Development of Algorithm and Load Balancing for detail scheduling (소일정 계획 수립을 위한 부하조정과 알고리즘 개발에 관한 연구)

  • 김정자;김상천;공명달
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.46
    • /
    • pp.241-251
    • /
    • 1998
  • There are two methods of load balancing for detail scheduling : One method is to generate an initial schedule and obtain an improved final schedule by load balancing only during a specific period. The other method is to generate an initial schedule and obtain an improved schedule by load balancing from current date(TIMENOW) to unlimited time with the whole manufacturing processes. This paper proposes an algorithm for detail scheduling which can be a practical solution in job shop production or project job type by applying the former method.

  • PDF