• 한국경영과학회지
• /
• 제17권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.

• 품질경영학회지
• /
• 제19권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.

• 산업경영시스템학회지
• /
• 제29권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.

• 대한산업공학회지
• /
• 제12권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.

• 산업경영시스템학회지
• /
• 제15권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.

• 한국전자거래학회지
• /
• 제24권3호
• /
• pp.99-110
• /
• 2019

4차 산업혁명이 진행되면서 제조업에서 사물인터넷(IoT), 머신러닝과 같은 지능정보기술을 적용하는 사례가 증가하고 있다. 반도체/LCD/타이어 제조공정에서는 납기일(due date)을 준수하면서 작업물 종류 변경(Job change)으로 인한 작업 준비 비용(Setup Cost)을 최소화하는 일정계획을 수립하는 것이 효과적인 제품 생산을 위해 매우 중요하다. 따라서 본 연구에서는 병렬기계에서 딥러닝 기반의 납기 지연과 작업 준비 비용 최소화를 달성하는 일정계획 생성 모델을 제안한다. 제안한 모델은 과거의 많은 데이터를 이용하여 고려되어지는 주문에 대해 작업 준비와 납기 지연을 최소화하는 패턴을 학습한다. 따라서 세 가지 주문 리스트의 난이도에 따른 실험 결과, 본 연구에서 제안한 기법이 기존의 우선순위 규칙보다 성능이 우수하다는 것을 확인하였다.

• 한국유기농업학회지
• /
• 제31권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.

• 수산경영론집
• /
• 제42권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.

• 산업경영시스템학회지
• /
• 제14권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.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• 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.