• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.295-298
• /
• 1996

We consider a nonpreemptive single-machine scheduling problem to minimize the mean squared deviation(MSD) of job completion times about a common due date d with a maximum tardiness constraint, i.e., maximum tardiness is less than or equal to the given allowable amount, .DELTA.(MSD/T$_{max}$ problem). We classify the .DELTA.-unconstrained cases in the MSD/T$_{max}$ problem. We provide bounds to discern each case for the problem. It is also shown that the .DELTA.-unconstrained MSD/T$_{max}$ problem is equivalent to the unconstrained MSD problem and the tightly .DELTA.-constrained MSD/T$_{max}$ problem with n jobs and a maximum allowable tardiness .DELTA. can be converted into the constrained MSD problem with a common due date .DELTA. and n-1 jobs. Finally, the solution procedure for MSD/T$_{max}$ problem is provided. provided.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.93-113
• /
• 2007

In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.369-374
• /
• 2000

Despite their tilde application of some traditional project management techniques like the Program Evaluation and Review Technique, they lack of learning, one of important factors in many disciplines today due to a static view far prefect progression. This study proposes a framework for estimation by learning based on a Linear Bayesian approach. As a project progresses, we sequentially observe the durations of completed activities. By reflecting this newly available information to update the distribution of remaining activity durations and thus project duration, we can implement a decision support system that updates e.g. the expected project completion time as well as the probabilities of completing the project within talc due date and by a certain date. By Implementing such customized systems, project manager can be aware of changing project status more effectively and better revise resource allocation plans.

• International conference on construction engineering and project management
• /
• 2011.02a
• /
• pp.201-208
• /
• 2011

Today's highly competitive construction scenario forces all the major players in the field to take up multiple projects which have put an undue pressure on the resources available within the organization. Under such a situation, there are many instances where in the resource requirement exceeds its availability due to multiple activities (with same resource requirement) which are scheduled to start simultaneously and thus results in the constrained resource becoming a bottleneck of the project. As a consequence of sharing resources, this paper studies the impact on the completion date of two similar projects under two different conditions, the first one resulting in a postponed end date and the second without any postponement. The resource utilization, the possibility of substitution of a resource and its subsequent impact on the deadline of the project is analyzed under these two circumstances. The study is done on a Critical Chain Project Management (CCPM) platform instead of leaving the schedule with a traditional Critical Path Method (CPM) finish, which gives an added advantage of validating the robustness of the emerging CCPM trend in the field of resource management.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.4
• /
• pp.155-170
• /
• 2004

Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.449-455
• /
• 2002

This paper considers that advanced planning and scheduling (APS) in manufacturing and the efficient purchasing where each customer order has its due date and multi-suppliers exit We present a Make-To­Order Supply Chan (MTOSC) model of efficient purchasing process from multi-suppliers and APS with outsourcing in a supply chain, which requires the absolute due date and minimized total cost. Our research has included two states. One is for efficient purchasing from suppliers: (a) selection of suppliers for required parts; (b) optimum part lead­time of selected suppliers. Supplier selection process has received considerable attention in the business­management literature. Determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions usually is complex and unstructured. These influence factors can be divided into quantitative and qualitative factors. In the first level, linguistic values are used to assess the ratings for the qualitative factors such as profitability, relationship closeness and quality. In the second level a MTOSC model determines the solutions (supplier selection and order quantity) by considering quantitative factors such as part unit price, supplier's lead-time, and storage cost, etc. The other is for APS: (a) selection of the best machine for each operation; (b) deciding sequence of operations; (c) picking out the operations to be outsourcing; and (d) minimizing makespan under the due date of each customer's order. To solve the model, a genetic algorithm (GA)-based heuristic approach is developed. From the numerical experiments, GA­based approach could efficiently solve the proposed model, and show the best process plan and schedule for all customers' orders.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.23-38
• /
• 1995

In manfacturing systems, to overcome the inherent complexities and uncertainties, due-dates are usually decided by some simple rules. This study proposes a computational procedure for estimating production lead time for computerized manufacturing systems. Based on the current system status stored in the computers, the procedure estimates production lead time for an incoming order. The result is more accurate than the ones produced by old rules, and yet the procedure is fast in computation speed enough to use in real time. Simulations are used to prove these.

• The Journal of Society for e-Business Studies
• /
• v.15 no.1
• /
• pp.89-101
• /
• 2010

In some industries, manufacturing firms' distinctive competences include not only product superiority but also service excellence. For example, in a highly volatile and dynamic market, flexibility and responsiveness are more valued than just the product cost. And sales order processing, in that respect is a very important process. However, previous studies on sale order processing have considered only due-date assignments or dealt with production scheduling to minimize production cost or delivery lead time. Due to recent advances in information technology, a new approach is possible in dealing with sales order processing. For example, RFID(Radio Frequency IDentification) and ubiquitous computing technology adds real time visibility and traceability to supply chain. In this study, we develop a new due-date re-negotiation process for sales order management and propose a new business integration model to support the re-negotiation process based on RFID, ubiquitous computing technology and RosettaNet's PIPs.

• Management Science and Financial Engineering
• /
• v.18 no.2
• /
• pp.5-11
• /
• 2012

In this paper, stochastic scheduling problems are considered when processing times and due dates follow arbitrary distributions and due dates are either common or exchangeable. For maximizing the expected number of early jobs, two policies, one, based on pairwise comparisons of the processing times, and the other, based on survivabilities, are introduced. In addition, it is shown that the former guarantees optimal solutions when the processing times and due dates are deterministic and that the latter guarantees optimal solutions when the due dates follow exponential distributions. Then a new approach, exploiting the two policies, is proposed and analyzed which turns out to give better job sequences in many situations. In fact, the new approach guarantees optimal solutions both when the processing times and due dates are deterministic and when the due dates follow exponential distributions.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2020.06a
• /
• pp.220-221
• /
• 2020

Strarting with Buyeong Apartment in Dongtan-2 disrict in 2017, collective complaints of residents are frequently occurring due to low quality problem such as improper construction and defects of apartment houses. Because of this, the Ministry of Land and Transport is preparing a comprehensive improvement scheme to improve the quality of Apartment Housing(AH), taking into account the continuing complaints from the residents of AH and the problem raised by the National Assembly. The basic profile of the improvement scheme is induce the tenants and experts to discover and point out defects that are repaired until the date of use inspection or due date. For this purpose, we suggested this defects management system linkaged by the preliminary inspection and quality inspection system for prospective occupants. In this context, this paper aims to suggest an effective likage method between the preliminary inspection of prospective residents and the quality inspection system implemented by local governments as an ordinance.