• Title/Summary/Keyword: Gantt Chart

Search Result 25, Processing Time 0.025 seconds

LSB 스케줄링기법의 소개

  • Park Chang Gyu;Kim Hyeon Jun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.944-948
    • /
    • 2002
  • In industrial production setting scheduling problems of detalied day-to-day operations are often ordeals to production practitioners. For those who have scheduling experience with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large stale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. This paper introduces a new LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through the computer simulation in a hypothetical setting, this paper provides a comparison of LSB scheduling with existing algorithms and a guideline for selecting the suitable algorithm for certain industrial setting.

  • PDF

LSB Algorithm for the Job Oriented Heuristic Scheduling (작업지향 탐색적 일정계획을 위한 LSB 기법)

  • Kim Hyun-joon;Park Changkyu
    • Korean Management Science Review
    • /
    • v.21 no.2
    • /
    • pp.79-91
    • /
    • 2004
  • In industrial production settings, scheduling problems for detailed day-to-day operations are often ordeals to production practitioners. For those who have scheduling experiences with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large scale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. In this paper, we Introduce the LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through a computer experiment in a hypothetical setting, we make a performance comparison of LSB scheduling algorithm with existing algorithms and also suggest a guideline for selecting the suitable algorithm for certain industrial settings.

A Fundamental Study on the Expert System for the Operations Management in Wood Furniture Industry (목가구(木家具) 생산관리(生産管理)를 위한 전문가(專門家) 시스템의 기초(基礎) 연구(硏究))

  • Kim, Il-Sook;Lee, Hyoung-Woo
    • Journal of the Korean Wood Science and Technology
    • /
    • v.21 no.2
    • /
    • pp.23-30
    • /
    • 1993
  • As the demand of wood furniture becomes diverse and large-sized, artificial intelligence technique is required to design the expert system which can promote the efficiency of the operations management in wood furniture industry. This study was carried out to develop the expert scheduler, which was applied to the scheduling in chair-manufacturing process to evaluate its validity. The expert scheduler could show the results of scheduling must faster than Gantt chart method with ease. Maximum tardiness in the current chair-manufacturing process could be reduced from 29 seconds to 5 seconds by the addition of a spindle sander, a 12 spindle universal boring machine, and a moulding sander to sanding, boring, and moulding process, respectively.

  • PDF

A Study on Development of the Aircraft Scheduling System Using ILOG (ILOG를 이용한 항공기 운항 일정계획 시스템 개발에 관한 연구)

  • 윤종준;이장춘;이화기
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.24 no.65
    • /
    • pp.89-102
    • /
    • 2001
  • In this paper, the aircraft route scheduling consists of two steps; the pairing generation and the aircraft assignment. The pairing generation is heuristic approach how flights construct pairings from and to the main base. The aircraft resource assignment which is to establish a aircraft route schedule is constructed by constraint satisfaction problem technique. ILOG solver and schedule is used to solve this problem. In addition, a aircraft route reschedule process against departure-arrival delay or aircraft maintenance schedule change is added by partial constraints satisfaction problem technique. Also, Gantt chart made by ILOG views is used to show aircraft route schedule results more easily.

  • PDF

A Critical Path Search and The Project Activities Scheduling (임계경로 탐색과 프로젝트 활동 일정 수립)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.141-150
    • /
    • 2012
  • This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

Functional Analysis of 4D CAD System and Improvement of Function for Applying Linear Construction Project (4D CAD시스템의 기능분석 및 선형시설물 적용을 위한 기능 개선 방안)

  • Kim, Hyeon-Seoug;Kang, Leen-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.9
    • /
    • pp.269-278
    • /
    • 2018
  • In Korea, BIM technology is applied mainly to building construction projects, but is expected to be applied rapidly to civil engineering projects because the government is currently considering the mandatory application of BIM for infrastructure facilities. Because the infrastructure project is processed in a horizontal work area, the application of BIM technology is more useful in the schedule management of the construction phase than the interference management of the design phase. The 4D CAD system is a typical BIM technology applied to the schedule management in the construction phase, but the application to the actual project is limited due to the lack of practical functions. This study examined the functions of four representative 4D CAD systems commercialized so that the selection criterion can be provided according to the characteristics of the project, and suggests that the functions that should be improved to have practicability. As a result of functional analysis, the application characteristics of each system were analyzed and the user convenience was suggested. In addition, a linear 4D simulation methodology was developed to improve the functions applicable to civil engineering projects, and ways to improve the utilization of the infrastructure projects as the construction phase BIM were suggested. In railway and road construction projects, most activities, such as earthwork, bridges, and tunnels proceed along the distance axis in a horizontal space. Therefore, a linear 4D simulation method, in which an activity is expressed along a distance axis, can be more practically useful rather than a simple 4D simulation method with a Gantt chart.

Application of Linear Schedule Chart by Linking Location Information of Construction Project with Horizontal Work Space (수평작업공간을 갖는 건설프로젝트의 위치정보 연동에 의한 선형공정표 적용방안)

  • Han, Seon Ju;Kim, Hyeon Seung;Park, Sang Mi;Kang, Leen Seok
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.4
    • /
    • pp.601-610
    • /
    • 2018
  • Since the building construction works are repeated vertically in a limited space, there is not a great need for the location information of each activity in the schedule management. On the other hand, civil engineering works such as road and railway projects consist of a large number of earthworks, long bridges, and long tunnels. These types of work should be controlled in a horizontal space according to the linear axis of several tens of kilometers. In other words, since most of the activities are managed in the unit of distance from the start point to the end point, it is possible to improve the efficiency of the schedule management by linking the location information of the activity with the schedule data in the schedule management system. This study presents a methodology for creating a linear schedule chart specific to a project with horizontal work space and compares the convenience with the existing Gantt chart. In addition, the methodology of linking linear schedule chart to the 4D CAD system, which is a typical BIM technology in the construction phase, is presented to improve the usability of BIM. The practical applicability of the proposed methodology was verified statistically.

High-level Discrete-event Modeling-based Business Process Simulation for the Scheduling of the Ship Hull Production Design (조선 선체 생산설계 일정 계획을 위한 상세 이산사건 모델링기반 비즈니스 프로세스 시뮬레이션)

  • Son, Myeong-Jo;Kim, Tae-Wan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.3
    • /
    • pp.224-233
    • /
    • 2013
  • For the scheduling and the job assignment of the ship hull production design which is a process-based work, we suggest the simulation-based scheduling using the discrete-event-based business process simulation. First, we analyze the ship hull production design process from the perspective of a job assignment to make it into the simulation model using DEVS (Discrete Event System Specification) which is the representative modeling method for a discrete-event simulation. Based on the APIs of the open-source discrete-event simulation engine, we implement the simulation using the Groovy script. We develop the scenario generator in which the user defines detail information of the construction drawing and its member blocks, and design engineers information, and the various setting for the simulation including the job assignment strategy. We use the XML files from this scenario generator as inputs of simulation so that we can get simulation result in forms of Gantt chart without changes of the simulation model.

Project Schedule Notification and Issue Tracking System Based on Social Networking Service on a Smartphone (스마트폰 상에서 프로젝트 관리를 위한 소셜 네트워킹 서비스 기반의 일정 통지 및 이슈추적 시스템)

  • Kang, Dae-Ki;Chang, Won-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.669-677
    • /
    • 2010
  • In this paper, we propose a novel project schedule notification and issue tracking system based on a social networking service for project management on a smartphone. The proposed system has a server subsystem and a client subsystem. The server is in charge of enabling a deadline notification and an issue tracking of the project to project participants by exploiting a legacy social networking service. The client running on a smartphone displays timelines of the project schedule using Gantt chart and let the project participant edit their schedule. The proposed system combines the mobility of smartphones and the connectivity of social networking services and apply them to schedule notification and issue tracking, which demonstrates a novel usage of social networking services.

Optimal scheduling of multiproduct batch processes with various due date (다양한 납기일 형태에 따른 다제품 생산용 회분식 공정의 최적 생산계획)

  • 류준형
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.844-847
    • /
    • 1997
  • In this paper, scheduling problem is dealt for the minimization of due date penalty for the customer order. Multiproduct batch processes have been dealt with for their suitability for high value added low volume products. Their scheduling problems take minimization of process operation for objective function, which is not enough to meet the customer satisfaction and the process efficiency simultaneously because of increasing requirement of fast adaptation for rapid changing market condition. So new target function has been suggested by other researches to meet two goals. Penalty function minimization is one of them. To present more precisely production scheduling, we develop new scheduling model with penalty function of earliness and tardiness We can find many real cases that penalty parameters are divergent by the difference between the completion time of operation and due date. That is to say, the penalty parameter values for the product change by the customer demand condition. If the order charges different value for due date, we can solve it with the due date period. The period means the time scope where penalty parameter value is 0. If we make use of the due date period, the optimal sequence of our model is not always same with that of fixed due date point. And if every product have due date period, due date of them are overlapped which needs optimization for the maximum profit and minimum penalty. Due date period extension can be enlarged to makespan minimization if every product has the same abundant due date period and same penalty parameter. We solve this new scheduling model by simulated annealing method. We also develop the program, which can calculate the optimal sequence and display the Gantt chart showing the unit progress and time allocation only with processing data.

  • PDF