• 산업경영시스템학회지
• /
• 제13권21호
• /
• pp.143-151
• /
• 1990

This paper studies a single machine scheduling problem in which all jobs have the common due date and penalties are assessed for jobs at different rates. The scheduling objective is to minimize the weighted mean absolute deviations(WMAD). This problem may provide greater flexibility in achieving scheduling objectives than the mean absolute deviation (MAD) problem. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. This article extends the results to the problem to the problem of scheduling n-jobs on m-parallel identical processors in order to minimize the weighted mean absolute deviation.

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

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

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

• 한국가구학회지
• /
• 제19권2호
• /
• pp.130-136
• /
• 2008

The objective of this study was to date coffin woods of a grave of husband and wife, using the tree rings, which were excavated from Hoamdong, Chungju city in the central area of South Korea. The species of coffin woods was Japanese Red Pine (Pinus densiflora S. et Z.), one of the major conifers growing in Korea. The husband coffin was dated as A.D. 1628. Due to the absence of bark in the wife's coffin, the number of sapwood rings was estimated to obtain the cutting date. The cutting date of wife's one was estimated to be A.D. 1651${\pm}$10. The Jeogori Jacket for women, which was found in the husband coffin, indicates that the husband died earlier than the wife, as the tree-ring dates suggested.

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

• 산업경영시스템학회지
• /
• 제27권4호
• /
• pp.141-146
• /
• 2004

This research considers the problem of scheduling jobs on unrelated 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 and other production systems is bottleneck and the processing speeds of parallel machines in this phase are different for each job. A zero-one integer programming formulation is presented and two dominance properties are proved. By these dominance properties, it is shown that the problem is reduced to asymmetric assignment problem and is solvable in polynomial time.

• 천문학회지
• /
• 제38권2호
• /
• pp.43-57
• /
• 2005

The authors have assembled a sample of 80 W UMa binary systems (42 W-subtype and 38 A-subtype) whose light curves have all been solved by means of the recent W-D code and combined with up-to-date radial velocity solutions. The absolute parameters (masses, radii and luminosities) have been derived (without any constraint on the physical parameters). The main results of this paper are: (1) the mass-luminosity relations for both W&A-subtypes. as well as for all W UMa contact binaries have been shown, (2) the mass-radius relations have been found for both subtypes, (3) some remarks on the evolution status have been presented.

• 한국가구학회지
• /
• 제20권4호
• /
• pp.274-280
• /
• 2009

The purpose of this study was to identify the species of coffin woods excavated at Mundangdong in Gimcheon and to date this coffin by using tree-ring method. All coffin woods were identified as red pines, most possibly, Pinus densiflora S. et Z. Tree-ring dating provided absolute years of 3 among 19 coffins. Both I-9 and II-22 coffins were estimated to be made in the mid-seventeenth century, and I-65-1 in the mid-sixteenth century. Others possessed too few rings to be dated.

• 한국가구학회지
• /
• 제25권1호
• /
• pp.55-60
• /
• 2014

The objective of this study was to date a Buddhist wooden Tablet (No. 271) at Songkwangsa Temple, Suncheon, Korea, using wiggle matching of radiocarbon dates. For wiggle matching, three samples (2nd, 16th and 34~35th rings from inner side) in the pedestal of the Tablet were selected among total of 37 tree rings. Wiggle matching the radiocarbon dates of three samples resulted in A.D. 1660~1679 (95.4% confidence interval) for the outermost ring. This interval suggested the age of this tablet as the late 17th century, which was almost at the same age as other early Buddhist tablets in Korea.