• 무역상무연구
• /
• 제63권
• /
• pp.111-132
• /
• 2014

This paper analyzed the obligations of the parties entering into an international leasing agreements, focusing on the Draft Common Frame of Reference (DCFR) Book IV, Part B. The lessor's obligations are as follows. i) The lessor must deliver goods to the lessee by the due date of delivery so that the lessee can use the goods on the starting date of the lease agreement. ii) The lessor must conform with the contract so that the goods meet the purpose of the contract at the start of the lease agreement and throughout the period of the lease agreement. iii) If the lessee returns the goods upon the termination of the lease agreement, the lessor must cooperate with the lessee. The lessee's obligations are as follows. i) The lessee must pay rent, which is the most critical obligation of the lessee. ii) The lessee must cooperate with the lessor so that the lessor can perform the obligation to deliver the goods and accept the goods of which the lessee shall take control. iii) The lessee shall perform fiduciary duties while it uses and makes profits from the goods, and when the lessor cannot take any measure to protect the object, the lessee must prevent damage. Further, if the lessor pays expenses that are not considered necessary expenses, the lessor may not be reimbursed and must accept the goods after delivery to preserve them. iv) The lessee must give notice to the lessor if there is a possibility that a third party can claim rights to goods or infringe upon the lessor's ownership while using the goods. v) At the end of the lease period, the lessee must return the goods to the lessor.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• 한국경영과학회지
• /
• 제13권1호
• /
• pp.57-57
• /
• 1988

This paper develops an adaptive scheduling policy for flexible manufacturing systems. The inductive learning methodology used for constructing this state-dependent scheduling policy provides and understanding of the relative importance of the various system parameters in determining the appropriate scheduling rule. Experimental studies indicated the superiority of the suggested approach over the alternative approach involving the repeated application of a single scheduling rule for randomly generated test problems as well as a real system, and under both stationary and nonstationary conditions. In particular, its relative performance improves further when there are frequent disruptions, and when disruptions are caused by the introduction of tiiight due date jobs, one of the most common surces of disruptions in most manufacturing systems.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.115-130
• /
• 1995

This paper considers a single machine nonpreemptive scheduling problem with a given common due date. In the problem, the optimal job sequence is sought to minimize the sum of earliness/tardiness and flow time measures in the situation where all jobs are available at time zero, and weights per unit length of earliness/tardiness and flow time are V and W, respectively. Some dominant solution properties are characterized to deriva both an optimal starting time for an arbitrary sequence and sequence improvement rules. The optimal schedule is found to the case W .geq. V/. By the way, it is difficult to find the optimal schedule for the case W < V. Therefore, the derived properties are put on together to construct a heuristic solution algorithm for the case W < V, and its effectiveness is rated at the mean relative error of about 3% on randomly generated numerical problems.

• 경영과학
• /
• 제13권1호
• /
• pp.57-70
• /
• 1996

This paper develops an adaptive scheduling policy for flexible manufacturing systems. The inductive learning methodology used for constructing this state-dependent scheduling policy provides and understanding of the relative importance of the various system parameters in determining the appropriate scheduling rule. Experimental studies indicated the superiority of the suggested approach over the alternative approach involving the repeated application of a single scheduling rule for randomly generated test problems as well as a real system, and under both stationary and nonstationary conditions. In particular, its relative performance improves further when there are frequent disruptions, and when disruptions are caused by the introduction of tiiight due date jobs, one of the most common surces of disruptions in most manufacturing systems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.884-887
• /
• 2002

This paper considers a scheduling problem of routers with VOQ(Virtual Output Queue)s, where the router has an N ${\times}$N port input-queued switch and each input queue is composed of N VOQs. The objective of the paper is to develope scheduling algorithms which minimize mean tardiness under a common due date. The paper characterizes the optimal solution properties. Based upon the characterization, a integer programming is formulated for the optimal solution and two optimal solution algorithms are developed for two special cases of 2 ${\times}$2 switch and N${\times}$N switch with identical traffic.

• 산업경영시스템학회지
• /
• 제38권1호
• /
• pp.65-73
• /
• 2015

This paper considers a parallel-machine scheduling problem with dedicated and common processing machines using GA (Genetic Algorithm). Non-identical setup times, processing times and order lot size are assumed for each machine. The GA is proposed to minimize the total-tardiness objective measure. In this paper, heuristic algorithms including EDD (Earliest Due-Date), SPT (Shortest Processing Time) and LPT (Longest Processing Time) are compared with GA. The effectiveness and suitability of the GA are derived and tested through computational experiments.

• 대한산업공학회지
• /
• 제18권2호
• /
• pp.141-147
• /
• 1992

This article evaluates the efficiency of three branch-and-bound heuristics for a job scheduling problem that minimizes the sum of absolute deviations of completion times from a common due date. To improve the performance of the branch-and-bound procedure, Algorithm SA is presented for the initial feasible schedule and three heuristics : breadth-first, depth-first and best-first search are investigated depending on the candidate selection procedure. For the three heuristics the CPU time, memory space, and the number of nodes generated are computed and tested with nine small examples (6 ${\leq}$ n ${\leq}$ 4). Medium sized random problems (10 ${\leq}$ n ${\leq}$ 30) are also generated and examined. The computational results are compared and discussed for the three heuristics.

• 한국작물학회지
• /
• 제28권3호
• /
• pp.285-290
• /
• 1983

수도의 안전재배기간을 설정하기 위하여 수원등 9개지역의 기온조건을 분석하여 재배시기별 기준온도의 출현확율을 이용하는 방안과 평년 평균기온을 이용하는 H-U법과 비교검토하고 확율법에 의한 지역별 안전 이앙기, 출수기 및 성숙기를 설정하였다. 확율법에 의한 작기는 기상의 년차별 변이에 대한 안전성을 기할 수 있었으나 H-U법은 안정성이 적었다. 확율법에 의한 이앙기 조한일은 출현율 75-90%를 기대할 수 있는 경우 중북부지역은 5월 12일-22일, 동해연변지는 5월 15일-25일, 남부지방은 5월 4일-16일이었다. 춘천지방에서는 이앙에서 출수까지 소요정산온도가 1$700^{\circ}C$ 이상인 중만생종 품종은 부적합한 것으로 보이며 동해안변지인 강릉에서는 190$0^{\circ}C$이상 만생종은 부적한 것으로 판단된다. 호적출수기는 남부지방에서 통일계품종은 8월 초순, 일반계품종은 8월 중순이며, 강릉과 춘천지방에서는 통일계품종의 안전출수기간이 짧아 재배가 부적합한 것으로 나타났다. 성숙기 만한일은 중북부 지방에서 9월 30일-10월 2일, 동해연변지에서 10월 13일-14일, 그리고 남부지방에서 10월 7일-14일이며, 극초상일에 가까워 수확기에 상해에 대한 안정성도 기대할 수 있다.

• 한국지하수토양환경학회지:지하수토양환경
• /
• 제24권1호
• /
• pp.1-9
• /
• 2019

This study presents a technical perspective to the fate characteristics of phenol and m-cresol, which represent some of the most common organic chemicals found in chemical spill accidents, and likely to persist in soil and groundwater due to their highly stable physicochemical properties. Some cases of domestic and foreign chemical accidents linked to phenol and m-cresol contamination were compiled. Due to their low organic carbon-water partitioning coefficient (Koc), phenol and m-cresol tend to migrate into groundwater and remained as dissolved phase. On the other hands, phenol and m-cresol can be readily decomposed by microbes in soil and groundwater under appropriate conditions. Therefore, the fate characteristics of these chemicals are highly contingent on environmental conditions. Thus, if a great quantity of leakage is occurred by chemical accidents, the up-to-date and correct information about fate characteristics taking into account both the chemical and environmental conditions is greatly needed to minimized the potential hazards from these chemicals.