• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.51-62
• /
• 2013

This paper considers a single machine rescheduling problem whose original (efficiency related) objective is minimizing makespan. We assume that disruptions such as order cancelations and newly arrived orders occur after the initial scheduling, and we reschedule this disrupted schedule with the objective of minimizing a disruption related objective while preserving the original objective. The disruption related objective measures the impact of the disruptions as difference of completion times in the remaining (uncanceled) jobs before and after the disruptions. The artificial due dates for the remaining jobs are set to completion times in the original schedule while newly arrived jobs do not have due dates. Then, the objective of the rescheduling is minimizing the maximum earliness without tardiness. In order to preserve the optimality of the original objective, we assume that no-idle time and no tardiness are allowed while rescheduling. We first define this new problem and prove that the general version of the problem is unary NP-complete. Then, we develop three simple but intuitive heuristics. For each of the three heuristics, we find a tight bound on the measure called modified z-approximation ratio. The best theoretical bound is found to be 0.5 - ${\varepsilon}$ for some ${\varepsilon}$ > 0, and it implies that the solution value of the best heuristic is at most around a half of the worst possible solution value. Finally, we empirically evaluate the heuristics and demonstrate that the two best heuristics perform much better than the other one.

• The Korean Journal of Emergency Medical Services
• /
• v.5 no.1
• /
• pp.177-198
• /
• 2001

The purpose of this research which was conducted by surveying the transfer consultation records from 360 medical institutions such as general hospitals, hospitals, clinics to the Emergency Medical Center at E University Hospital for six months(Jan. 1, 2000 - Jun. 30, 2000) are to standardize & complete transfer consultation record of hospitals at the 1st & 2nd referral level and to give patients transferred emergency medical center medical information services on a better quality. The conclusions and suggestions from this study were summarized as follows; (1) Examing the distribution of the referral medical consultation(transfer) sheet type, surgery part local clinic sheet types were 34.4%, medical part local clinic sheet types were 26.7%, undifferentiated local clinic sheet types were 23.9% and hospital level sheet types were 15.0%. (2) The items of the transfer consultation records had been standardized more than 75% in the order of patient's name, date, doctor's name, diagnosis, patient's status, impressions. (3) That the degree of recording completion on these items is in the order of patient's name, date, diagnosis, impressions was revealed. (4) Because the standardization and the degree of recording completion are very low in the patient's gender, age, address, electronic recording system was needed for more perfect input of initial patient informations. (5) This standardizing & complete recording on examination and medication will prevent re-examination and abuse of medication for patients transferred emergency medical center. (6) EMT Transfer System should be fixed in all medical institute for the standardizing & complete recording on care period and departure time will give many emergency patients the proper treatments at the proper time. (7) It was revealed that developing new standardized transfer consultation record & using electronic recording system are needed. (8) The complete recording & Fast Track System were needed for higher rate of bed operation at emergency medical center and more hospital profit.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.6
• /
• pp.681-688
• /
• 2020

The Under Space Integrated Map has been constructed consistently from '15 construction projects until the present time in an effort to implement the "ground sinking prevention method" for the purpose of strengthening underground safety management. The constructed Under Space Integrated Map is utilized to provide information to the person in charge at local government through application of the system of underground information based on the administrative network and to deliver this to specialized underground-safety-effects -evaluation organizations through map extraction based on a floor plan. It suffers from a limitation in its practical use, however, since information is only provided, without promoting a separate renewal project. Although in Section 1 of Article 42 in the Special Law Concerning Underground Safety Management the content pertaining to submission obligations of completion drawings related to underground information including change and renewal are stated explicitly in order to solve this problem, submission is not sufficient since a submission window based only on the administrative network is operated. Accordingly, the Ministry of Land, Infrastructure, and Transport constructed an online system for submitting completion drawings, in an attempt to change the method by which entities involved in underground development directly submitted completion drawings. In this study, a DB standard relating to submitting completion drawings was designed and applied in order to construct an auto-renewal system based on submitted completion drawings, which will be extended to cover the range to underground structures hereafter.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.23-32
• /
• 2020

Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

• Management Science and Financial Engineering
• /
• v.20 no.2
• /
• pp.33-37
• /
• 2014

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature convergence that may cause the loss of search power. The performance of HGA is compared with that of genetic algorithms (GAs).

• Journal of Distribution Science
• /
• v.16 no.2
• /
• pp.19-24
• /
• 2018

Purpose - Drone delivery is expected to revolutionize the supply chain industry. This paper aims to introduce a collaborative parcel delivery problem by truck and drone (hereinafter called "TDRP") and propose a novel heuristic method to solve the problem. Research design, data, and methodology - To show the effectiveness of collaborative delivery by truck and drone, we generate a toy problem composed of 9 customers and the speed of drone is assumed to be two times faster than truck. We compared the delivery completion times by 'truck only' case and 'truck and drone' case by solving the optimization problem respectively. Results - We provide literature reviews for truck and drone routing problem for collaborative delivery and propose a novel and original heuristic method to solve the problem with numerical example. By numerical example, collaborative delivery is expected to reduce delivery completion time by 12~33% than 'truck only' case. Conclusions - In this paper, we introduce the TDRP in order for collaborative delivery to be effective and propose a novel and original heuristic method to solve the problem. The results of research will be help to develop effective heuristic solution and optimize the parcel delivery by using drone.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.615-619
• /
• 2004

This paper considers a variation of customer order scheduling problems. The variation is the case where machine-job assignment is fixed, and the objective is to minimize the sum of the completion times of the batches. In customer order scheduling problems, jobs are dispatched in batches. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. We first establish a couple of lower bounds. Then, we develop a dynamic programming (DP) algorithm that runs in exponential time on the number of batches when there exist two machines. For the same problem with arbitrary number of machines, we present two simple heuristics, which use simple scheduling rules such as shortest batch first and shortest makespan batch first rules. Finally, we empirically evaluate the heuristics.

• IE interfaces
• /
• v.11 no.2
• /
• pp.159-176
• /
• 1998

In the motor manufacturing system with the properties of short delivery and order based production, the process plan is performed individually for each order by the expert of process plan after the completion of the detail design process to satisfy the specification to be required by customer. Also it is hard to establish the standard process plan in reality because part routings and operation times are varied for each order. Hence, the production planner has the problem that is hard to establish the production schedule releasing the job to the factory because there occurs the big difference between the real time to be completed the process plan and the time to be required by the production planner. In this paper, we study the decision supporting system for the process plan based on knowledge base concept. First, we represent the knowledge of process planner as a database model through the modified POI-Feature graph. Then we design and implement the decision supporting system imbedded in the heuristic algorithm in the client/server environment using the ORACLE relational database management system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.8
• /
• pp.418-423
• /
• 2000

In this paper, we reported the current limiting properties of superconducting fault current limiters (SFCL). Our SFCL was patterned in a coil-type on a YBCO film deposited using rf sputtering techniques and was coated with a gold shunt layer in order to disperse the heat generated at hot spots in the YBCO film. Current increased up to 13.5 Apeak at 60 Hz for the voltage of 11.5 Vpeak, which is the minimum quench point, and increased up to 17.6 Apeak at 60 Hz for the voltage of 80 Vpeak. The quench completion time was 5 msec at 11.5 Vpeak and 4 msec at 80 Vpeak respectively. We think that this architecture using coil-type SFCL can be useful for the protection of the power delivery systems from fault currents.