• The Journal of Bigdata
• /
• v.7 no.1
• /
• pp.75-87
• /
• 2022

This study investigates a dynamic flexible flow shop scheduling problem under uncertain rework operations for an automobile pipe production line. We propose a weighted dispatching rule (WDR) based on the multiple dispatching rules to minimize the weighted sum of average flowtime and tardiness. The set of weights in WDR should be carefully determined because it significantly affects the performance measures. We build a discrete-event simulation model and propose a genetic algorithm to optimize the set of weights considering complex and variant operations. The simulation experiments demonstrate that WDR outperforms the baseline dispatching rules in average flowtime and tardiness.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.6 s.22
• /
• pp.170-178
• /
• 2004

Public construction companies have strictly followed a rule that they should not work in the wet area such as structural frame for a certain period during the winter season. It is usually known that the non-working period during the winter causes increase of the project duration, and the project cost escalation. Also, it makes negative effects on national economy because it reduces workers income. Therefore, the site work for the structural frame should be performed even during the whiter season. But the site work for the structural frame during that period cannot proceeds in the same way as during other periods, and requires a different method for estimating project duration. Through an analysis of time scheduling mechanism, actual working days are obtained for 1 cycle of typical floors in the structural frame during these periods, and non-working days of 5 years average are calculated based on calendar day using data of 5 years weather forecasts for that season. This study proposes an optimized way of estimating project duration for 1 cycle of typical floors in the structural frame during these periods. This estimating method uses the combined actual working days and non-working days of 5 years' average, and the estimated results are confirmed by being compared with field data. This study is expected to be used in estimating the construction duration of the structural frame during the winter season.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.1
• /
• pp.108-121
• /
• 2008

Dispatching rule for parallel machines with multi product is proposed in this paper, In current market,customer's request for higher quality is increasing, In accordance with such demand, manufacturers are focusingon improving the quality of the products. Such shift in production objective is risky. The possibility ofneglecting another important factor in customer satisfaction increases, namely due dates. From the aspect ofimproving quality, frequency of product assignment to limited number of high performance machines willincrease. This will lead to increased waiting time which can incur delays, In the case of due date orientedproduct dispatch, Products are assigned to machines without consideration for quality. Overall deterioration ofproduct quality is inevitable, In addition, Poor products will undergo rework process which can increase delays.The objective of this research is dispatching products to minimize due date delays while improving overallquality. Quality index is introduced to provide means of standardizing product quality. The index is used toassure predetermined quality level while minimizing product delays when dispatching products. Qualitystandardization method and dispatching algorithm is presented. And performance evaluation is performed withcomparison to various dispatching methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.107-119
• /
• 2004

A study on the following parallel machine problem is addressed in this research. An order is completed only when a given number of processes (cycle) are repeated. Anew cycle is possible only upon the completion of the previous cycle. Orders are classified into job group according to product feature. For a machine to switch to a different job group from the currently processing one a major setup is required while a minor setup time is inserted in between two jobs of the same job group. The objective of the study is to find a schedule that minimizes total weighted tardiness. An initial solution is obtained by the RATCS(Restricted Apparent Tardiness Cost with Setup) rule, and a Tabu search is applied to improve the solution. Numerical examples are also presented.

• Korean Chemical Engineering Research
• /
• v.47 no.6
• /
• pp.695-699
• /
• 2009

As a rule, when develop new product in company, multiple products that have similar function are developed simultaneously. These products are subjected to a group of tests covering quality, safety and durability. If the schedule of tests is changed, the expected net presented value(NPV) of new products is changed. The tests should be scheduled with the goal of maximizing the expected NPV of the new products. A model incorporated resource constraints with the sequencing of testing tasks of multiple products is proposed in this paper. Examples show that the proposed model can handle stochastic task duration data represented by scenarios with probabilities.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2006

This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control structure. A resource should be allocated for the processing of each job, and the required processing time of the job can be varied by the resource allocation decision. Each resource has several inherent restrictions such as the functional, geographical, positional and other operational characteristics. The algorithm suggested in this paper selects an effective resource for each job by considering the precedence constraint and the resource characteristics such as processing time and the inherent restrictions. To investigate the performance of the proposed algorithm, several numerical tests are performed for four different workflow graphs including standard, parallel and two series-parallel structures. In the tests, the solutions by the proposed algorithm are compared with random and optimal solutions which are obtained by a random selection rule and a full enumeration method respectively.

• IE interfaces
• /
• v.10 no.3
• /
• pp.75-93
• /
• 1997

Unlike individual applications, it is extremely hard to obtain user requirements for group systems, since there exists very complicated dynamics in group. This may result in spreading a great amount of products with a broad range of contents. Thus, this study presents a comparative analysis of groupware products. As a result, these products have been categorized into three areas which include cooperation/document management systems, collaborative writing systems, and decision-making/meeting systems. While the systems reviewed here focus on the cooperation/document management systems, the other two areas will be dealt in details in part Ⅱ. The first area ends up with two large categories such as proprietary groupware products and intranet groupware products. However, it has been observed that there is a natural convergence between these two categories. Consequently, the comparative analysis has been performed in terms of functions provided on the two categories and a combined category. Each group of the functions has been divided into three parts which consist of basic functions, quasi-basic functions, and others. Such a decision has been made based on the frequency rate of the functions provided in the products. With a more strict rule, the basic functions comprise electronic mail, sanction, bulletin board, document management, scheduling, security, Web browser, and Internet connectivity. This study also provides a framework for integrated functional model of groupware systems. The basic functions are merged into the model. However, the model is so flexible that it can partially include the quasi-functions in addition to the basic functions. In the future, it is expected that a large number of products will stem from the modification of the functional model.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.73-80
• /
• 1999

A major concern in Concurrent Engineering is the control and management of workload As a general rule, leveling the peak of workload in a period is difficult because concurrent processing is comprised of various processed, including overlapping, paralleling and looping and so on. Therefore workload management with resource constraints is so beneficial that effective methods to analyze design process are momentous. This paper presents a procedure to transform the IDEF3 process model into the precedence network model for more useful assessment of the process. This procedure is expected to facilitate resolving resource constrained scheduling problems more systematically in Concurrent Engineering environment.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.49-66
• /
• 1999

Semiconductor wafer fabrication is known to be one of the most complex manufacturing processes due to process intricacy, random yields, product diversity, and rapid changing technologies. In this study we are concerned with the impact of lot release and dispatching policies on the performance of semiconductor wafer fabrication facilities. We consider several semiconductor wafer fabrication environments according to the machine failure types such as no failure, normal MTBF, bottleneck with low MTBF, high randomness, and high MTBF cases. Lot release rules to be considered are Deterministic, Poisson process, WR(Workload Regulation), SA(Starvation Avoidance), and Multi-SA. These rules are combined with several dispatching rules such as FIFO (First In First Out), SRPT (Shortest Remaining Processing Time), and NING/M(smallest Number In Next Queue per Machine). We applied the combined policies to each of semiconductor wafer fabrication environments. These policies are assessed in terms of throughput and flow time. Basically Weins fabrication setup was used to make the simulation models. The simulation parameters were obtained through the preliminary simulation experiments. The key results throughout the simulation experiments is that Multi-SA and SA are the most robust rules, which give mostly good performance for any wafer fabrication environments when used with any dispatching rules. The more important result is that for each of wafer fabrication environments there exist the best and worst choices of lot release and dispatching policies. For example, the Poisson release rule results in the least throughput and largest flow time without regard to failure types and dispatching rules.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.222-229
• /
• 2022

Although stochastic programming and feedback control approaches could efficiently mitigate the overdue risks caused by inherent uncertainties in ground conditions, the lack of formal representations of planners' rationales for resource allocation still prevents planners from applying these approaches due to the inability to consider comprehensive resource allocation policies for hard rock tunnel projects. To overcome the limitations, the authors developed an ontology that represents the project duration estimation rationales, considering the impacts of ground conditions, excavation methods, project states, resources (i.e., given equipment fleet), and resource allocation policies (RAPs). This ontology consists of 5 main classes with 22 subclasses. It enables planners to explicitly and comprehensively represent the necessary information to rapidly and consistently estimate the excavation durations during construction. 10 rule sets (i.e., policies) are considered and categorized into two types: non-progress-related and progress-related policies. In order to provide simplified information about the remaining durations of phases for progress-related policies, the ontology also represents encoding principles. The estimation of excavation schedules is carried out based on a hypothetical example considering two types of policies. The estimation results reveal the feasibility, potential for flexibility, and comprehensiveness of the developed ontology. Further research to improve the duration estimation methodology is warranted.