• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• Journal of Korean Society for Quality Management
• /
• v.19 no.2
• /
• pp.125-132
• /
• 1991

This paper is concerned with the flow shop scheduling problems considering different weighted penalty costs for earliness and lateness, and a common due date. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty costs and for determining the optimal common due date. The positional weight index and, the product sum method are used. A numerical example is given for illustrating the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.2
• /
• pp.7-12
• /
• 2006

This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.1-11
• /
• 1986

This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.25
• /
• pp.23-31
• /
• 1992

This paper is concerned with an n jobs one machine Job shop scheduling problems in which all jobs have a common due date and unequal penalties occur when a job is completed before or after due date. The objective is to determine an optimal sequence and the corresponding common due date that yield the global minimum value of a penalty function Then a sequence that minimize the penalty function globally is a V-shaped sequence Using the idea of linear equations and a LGP(Linear Goal Programming), this paper shows that LGP and MAD(Mean Absolute Deviation) are equivalent problems. Therefore an efficient algorithm that is developed for MAD problem holds for LGP problem and vice-versa. A numerical example to account for the algorithm is provided.

• The Journal of Society for e-Business Studies
• /
• v.24 no.3
• /
• pp.99-110
• /
• 2019

As the 4th industrial revolution progressing, manufacturers are trying to apply intelligent information technologies such as IoT(internet of things) and machine learning. In the semiconductor/LCD/tire manufacturing process, schedule plan that minimizes setup change and due date violation is very important in order to ensure efficient production. Therefore, in this paper, we suggest the deep learning based scheduling generation model minimizes setup change and due date violation in parallel machines. The proposed model learns patterns of minimizing setup change and due date violation depending on considered order using the amount of historical data. Therefore, the experiment results using three dataset depending on levels of the order list, the proposed model outperforms compared to priority rules.

• Korean Journal of Organic Agriculture
• /
• v.31 no.1
• /
• pp.63-77
• /
• 2023

The purpose of this study is to help operate and manage the new food period, use-by-date by investigating consumer perception of various food periods, and change of purchasing and consumption period by food period label. Compared to the purchasing period of sell-by-date, the ratio of the purchasing period also increased as the proposed period of the use-by-date and the best before date increased. The use-by-date should be set at least 15 days to reduce food waste as the consumption period is the same as the sell-by-date. This can be said to have an anchoring effect that changes the purchasing and consumption period of consumers depending on how much the food period is indicated even for the same product. In order to reduce consumer confusion and food waste due to sell-by-date, it is considered to label the sell-by-date and use-by-date or use-by-date and best before date in parallel.

• The Journal of Fisheries Business Administration
• /
• v.42 no.2
• /
• pp.31-45
• /
• 2011

Costal fisheries use small boat. The boats are frequently substituted with newly made boat or proper boat. When the boat which is substituted with another one after the fixed date for compensation is estimated for fisheries loss by public project, it is matter that which boat is the object for estimating average catch of fish. There are three ways in practical business. They are based on the date of spot probe, the date of conference for compensation and fixed date for compensation. In case of applying the first and the second ways, as the object of compensation is not fixed, there is problem that estimated result can be changed depending on changing boat tons even after the date of spot probe and the fixed date for compensation. Most of all, these ways are against Attached Form No.4 of the Enforcement Ordinance of Fisheries Law which regulate to calculate average catch of fish applying result of fishery for retroactively counted 3 years from the year before the year in which administrative measure day is. The other side, in applying boat tons based on the fixed date for compensation, estimated result of compensation will not change even boat substituted after the fixed date for compensation. Even though applying tons based on the fixed date for compensation, a problem still remains. If the boat get bigger after the fixed date for compensation, the then boat size must be applied for calculating average catch. But the boat get smaller, the changed boat size must be applied. Because changed small boat would be damaged less than the previous boat. And decrease in catch by changing boat into small one is not due to the project but due to the personal responsibility. This will help to increase objectivity and reliance on the compensation result. As the other objects are fixed based on the fixed date for compensation in the Act on Acquisition and Compensation of Land and Others for Public Project, it can be balanced with other object.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.27-36
• /
• 1991

This paper considers scheduling a set of n-jobs on m-paraller identical processors in which all jobs have the common due date. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such common due dates under the assumption that each job has a different weight. and to determine the optimal value of a common due date. We propose four heuristic solution methods based on several dominance conditions, and its solution procedure is illustrated with numerical examples. The Performance comparison is made among four heuristic scheduling procedures.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.133-136
• /
• 2006

We consider dynamic lot-sizing model with production time windows where each of n demands has earliest due date and latest due date and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlog n) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest due dates.