• Title/Summary/Keyword: time schedule

Search Result 1,356, Processing Time 0.037 seconds

WIPI based E-mail and Schedule Management System (WIPI 기반의 이메일 및 일정 관리 시스템)

  • Kim Sung-Su;Song Wang-Cheol
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.7
    • /
    • pp.50-57
    • /
    • 2006
  • The implementation of cellular phone based applications has been growing very fast because of WIPI which is one of hardware independent platforms. In this paper, we design and implement a system to combine the animation avatar and e-mail service by using WIPI platform, so that the user can symbolize himself/herself by his/her avatar in using the email. Also, as the general email applications have functions to integrate the email and the scheduling, this system has the integrated email & scheduling functionality. At the same time, This system uses SMS service in order to notify scheduled time and it synchronizes the schedule data with Microsoft Outlook on the computer. So, this system extends the existing email applications by supporting the mobility.

  • PDF

A Study on developing WBS based QDBS(Quantity Database System) for the schedule and the cost data integration for road construction project (도로공사의 공정 및 공사비 연계활용을 위한 디지털 수량산출정보시스템(QDBS) 개발 연구)

  • Yun, Seok-Heon;Kim, Seong-Sig
    • Korean Journal of Construction Engineering and Management
    • /
    • v.8 no.4
    • /
    • pp.119-127
    • /
    • 2007
  • Cost and Schedule is the most important information, and how efficiently manage this information is the key issue for Construction Project Management. Domestically, systematic scheduling method such as CPM network is not only used widely but integration of time and cost information also is. In order to effectively integrate and use the time and cost information, it is suggested that WBS(Work Breakdown Structure) based QDB(Quantity Database) should be generated from the design phase and, WBS and QDB related system tool should be supported. It could be helpful to relate and integrate other construction project information.

The State of Schedule Management and the Recognition of Duration Shortening (공정관리의 실태 및 공기 단축에 대한 인식정도)

  • Kim, Ja-Yeon;Kim, Eui-Sik
    • Journal of the Korea Institute of Building Construction
    • /
    • v.10 no.5
    • /
    • pp.87-94
    • /
    • 2010
  • Construction projects are based on the actual field, so if the construction schedule that is established in the construction plan is delayed or extended for various reasons, construction companies are vulnerable to claims, and thus strive to complete a building within the planned timeline by shortening the construction time. Therefore, this study surveyed technicians in apartment construction in Gwangju, and studied their perceptions of the actual conditions of process control, construction time needs, goals, and methods. The results showed that the organization of the process control department and professional employees was lacking compared to other regions. The need for construction time was perceived as high, while the reduction of the construction cost was perceived as low. Regarding the reduction goal, they perceived highly the preparation for the delay of construction time and various claims, and for the reduction method, they mentioned the extension of working hours and the increase in employees. Based on the results of this study, technicians should consider that a reduction of construction time not only can make up for a delay in construction, but is also closely related to improvements in production through reduction of cost, and increased international competitiveness.

QA-MAC: QoS-Aware MAC Protocol for Wireless Sensor Networks

  • Kim, Seong-Cheol;Park, Hyun-Joo
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.223-227
    • /
    • 2010
  • In this paper, we present a QoS-aware MAC protocol (QA-MAC) for cluster based wireless sensor networks (WSNs). QA-MAC is a TDMA-based scheduling protocol that minimizes the energy consumption in multi-hop WSNs and provides Quality of Service (QoS). A dynamic scheduling algorithm according to the number of member nodes, node traffics, and traffic priorities is suggested. The selected cluster head allocates time slots for all member nodes in the first TDMA schedule period of each round. During the second schedule period in each round, the cluster head makes a schedule for all data transmission. The proposed QA-MAC (QoS-Aware MAC) could save energy, reduce transmission delay, and support QoS.

A Study on the Integrated Estimation of Delivery and Manufacturing Cost for Build-to-Order Manufacturing (주문형 생산에서의 납기 및 원가 예측 연동에 관한 연구)

  • 김인준;강무진
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.1456-1461
    • /
    • 2004
  • Companies of Build-to-Order(BTO) strive to achieve customer responsiveness and cost efficiency simultaneously. The success of BTO depends upon the high volume production based on product plat form and delayed differentiation principle on the one hand, and upon the rapid estimation of delivery and cost for the customer orders on the other hand. Expeditious processing of a specific order requires the rearrangement of production resources and the schedule, which results in increased cost. This paper describes a cost estimation method using activity-based costing depending on the schedule change caused by urgent customer orders.

  • PDF

A Production Schedule for Load Leveling in a Block Assembly Shop (블록조립공장의 부하평준화를 위한 생산일정계획)

  • Lee, Jae-Dong;Hong, Yu-Shin
    • IE interfaces
    • /
    • v.7 no.2
    • /
    • pp.75-85
    • /
    • 1994
  • This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

  • PDF

A Study on the Heuristics Algorithm for a establishing Vehicle Scheduling Plan under dynamic environments - With the emphasis on the GPS and Digital Map - (동적인 환경하에서의 차량경로계획 수립을 위한 발견적 기법에 관한 연구 - GPS와 전자지도의 활용을 중심으로 -)

  • 박영태;김용우;강승우
    • Proceedings of the Korean DIstribution Association Conference
    • /
    • 2003.05a
    • /
    • pp.55-70
    • /
    • 2003
  • The most transport companies are placing increasing emphasis on powerful new techniques for planning their vehicle operations. They have tried to improve their vehicle control and customer service capability by adopting tile advanced information technology, such as GPS(Global Position System) and Using Digital Map. But researches on the VRSP(vehicle routing St schedule problem) in this situation were very few. The purpose of this research is to develop vehicle scheduling heuristics for making a real-time dynamic VRSP under the situation that GPS and using Digital Map are equipped to the transport company. Modified savings techniques are suggested for the heuristic method and an insertion technique is suggested for the dynamic VRSP. The urgent vehicle schedule is based on the regular vehicle schedule. This study suggest on VRSP system using GPS and Digital Map and the performance of the suggested heuristics is illustrated through an real case example.

  • PDF

An Efficient Heuristic Technique for Job Shop Scheduling with Due Dates (납기를 갖는 job shop 일정계획의 효율적인 발견적기법)

  • 배상윤;김여근
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.3
    • /
    • pp.75-88
    • /
    • 1996
  • This paper presents an efficient heuristic technique for minimizing the objectives related to tardiness such as total tardiness, maximum tardiness and root mean of tardiness in the job shop scheduling. The heuristic technique iteratively improves an active schedule through exploring the schedule's neighborrhood, using operation move methods. The move operatio is defined on an active chain of tardy jobs in the active schedule. To find the move operations which have a high probability of reducing tardiness, we develop move methods by exploiting the properties of active chains. Our technique is compared with the two existing heuristic techniques, that is, MEHA(Modified Exchange Heuristic Algorithm) and GSP(Global Scheduling Procedure) under the various environmental with the three levels of due date tightness and several sized problems. The experimental results show that the proposed technique outperforms the two exissting techiques in terms of solution quality and computation time.

  • PDF

Preprocessing based Scheduling for Multi-Site Constraint Resources (전처리 방식의 복수지역 제약공정 스케줄링)

  • Hong, Min-Sun;Rim, Suk-Chul;Noh, Seung-J.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.1
    • /
    • pp.117-129
    • /
    • 2008
  • Make-to-order manufacturers with multiple plants at multiple sites need to have the ability to quickly determine which plant will produce which customer order to meet the due date and minimize the transportation cost from the plants to the customer. Balancing the work loads and minimizing setups and make-span are also of great concern. Solving such scheduling problems usually takes a long time. We propose a new approach, which we call 'preprocessing', for resolving such complex problems. In preprocessing scheme, a 'good' a priori schedule is prepared and maintained using unconfirmed order information. Upon the confirmation of orders. the preprocessed schedule is quickly modified to obtain the final schedule. We present a preprocessing solution algorithm for multi-site constraint scheduling problem (MSCSP) using genetic algorithm; and conduct computational experiments to evaluate the performance of the algorithm.

Automated guided vehicle routing for the fixed-interval deliveries of a flexible manufacturing system (일정한 납기구간을 갖는 유연생산시스템에서의 AGV 경로에 관한 연구)

  • 최현선;유융석;노인규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.2
    • /
    • pp.68-74
    • /
    • 2003
  • Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.