• Management Science and Financial Engineering
• /
• 제18권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 Operations and Management Science Society Conference
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.46-49
• /
• 1996

This paper presents a multi-pass heuristic for job shop scheduling with due dates. The proposed heuristic iteratively improves solutions based on operation due dates. To find a good solution efficiently, a method for searching the neighborhood of current schedule is developed. The heuristic is compared with two existing heuristics as well as several dispatching rules in terms of solution quality and computation time. The experimental results show that the proposed approach is promising.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제14권24호
• /
• pp.111-121
• /
• 1991

This paper considers a non preemtive single processor scheduling problem in which each set have the two common due dates. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such two common due dates under the assumption that each job has a different weight. Such a job sequence is an W-shaped sequence. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. The performance comparison is made among three heuristic scheduling procedures.

• Korean Management Science Review
• /
• 제29권3호
• /
• pp.157-168
• /
• 2012

In this study, we consider an order promising problem at parallel machine shops where orders arrive dynamically. We develop methods for the problem, which instantly quote the due-dates of arrived orders. In this study, we first propose methods which can estimate flow times of orders, in which the current and future inventory status as well as the specific scheduling scheme used in the shop are taken into account, and then the due-dates are set by the order promising methods using the estimation results. The quoted due-dates of orders are compared with the actual completion times of those which are obtained from the simulation runs. The series of computational experiments show that the superior performance of the proposed methods in terms of the accuracy of due-date quotation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제20권44호
• /
• pp.197-205
• /
• 1997

Manufacturers can meet the due dates of orders by using overtime, in which case, additional cost incurs for the amount of overtime. Although many studies have been reported on scheduling, only a few papers are founds on production scheduling using overtime. We consider the problem of production scheduling using overtime on a single machine, in which each job has a given due-date, a constant processing time. We assume that the daily overtime does not exceed the daily regular operation time. The objectives is to minimize the total overtimes, while meeting all due dates. We first present a mathematical model, and then suggest a heuristic algorithm for the problem.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.1-6
• /
• 2011

This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제25권2호
• /
• pp.47-57
• /
• 2000

In this paper we consider an n-job non-preemptive and identical parallel machine scheduling problem of minimizing the sum of earliness and tardiness with different release times and due dates. In the real world this problem is more realistic than the problems that release times equal to zero or due dates are common. The problem is proved to be NP-complete. Thus a heuristic is developed to solve this problem To illustrate its suitability a proposed heuristic is compared with a genetic algorithm for a large number of randomly generated test problems. Computational results show the effectiveness and efficiency of proposed heuristic. In summary the proposed heuristic provides good solutions than genetic algorithm when the problem size is large.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제24권3호
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• 제14권2호
• /
• pp.47-57
• /
• 2011

This study monitored forest plant species vulnerable to climate change in Jiri Mountain, one of Korea's representative alpine regions, in order to securely preserve plant genetic resources susceptible to climate change and to utilize the results as basic data for bioclimatology prediction and management on a long-term basis. A majority of indicator plants tended to blossom one week to one month later in 2010 than in 2009. As with the blooming dates, the falling dates of blossoms became later in most species, with the exception for Weigela florida and Oplopanax elatus. Leaf bursting as well fell on later dates in a majority of species excluding Carpinus laxiflora and Cupressus sempervirens, displaying the most obvious differences among the data of analysis of the 2009-2010 physiological cycle changes. It is believed that was due to the fact that temperatures in February, March and April, which affect plants' blossoming and leaf bursting, were lower in 2010 than in 2009 and that cold temperatures in the winter lasted for a longer period in 2010 than in 2009. The dates of leaves being changed to red were similar in 2009 and 2010 by being or later or earlier by several weeks in 2010 than in 2009 without any regularity. Most species' leaves began to fall at similar dates in 2009 and 2010 or at later dates by one to two weeks in 2010 than in 2009. The temperature differences in late 2009 and late 2010 were not so large, resulting in similar dates of falling leaves, and gaps in several indicator plants' physiological cycles without any regularity can be attributed to each individual plant's physiological and environmental characteristics.

• IE interfaces
• /
• 제25권1호
• /
• pp.106-113
• /
• 2012

There are few factors like a due date observance of the customer's order, reducing the manufacturing lead time, and minimizing the inventory investment to successfully run the manufacturing system. It is difficult for corporation and a person concerned to be offered indicators to achieve few factors mentioned above from complex manufacturing systems having much fluctuations. Simplified-DBR based on TOC(Theory of Constraints) is a management paradigm which can offer indicators to effectively face with fluctuating market's needs when market's demand is smaller than a capacity of manufacturing system. This paper is offering a core indicator and management model which is needed to successfully run the manufacturing system for corporation and a person concerned who have short experience and knowledge and newly construct Sinplified-DBR manufacturing system. Thus, this paper provides a systemic guidance in the offered model through the simulation.