• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1994년도 추계학술발표회 발표논문집; 연세대학교경영관, 서울; 8 Oct. 1994
• /
• pp.73-73
• /
• 1994

• 한국농촌건축학회논문집
• /
• 제20권1호
• /
• pp.1-10
• /
• 2018

In order to give back-to-farm residents the stable settlement environment in the rural area, the 'community village' is desirable as the village type and its village planning guideline should be supported as well. The purpose of this study was to develop a guideline for the planning of back-to-farm community village in the living and social environmental aspects, based on the comprehensive comparative analysis about items that field survey and literature suggested. The guideline for the living environment was developed for 6 items; village structure(adequate size, lot, outer space for household), village landscape(allocation, space composition), road system and transportation(parking lot in village, placement of bus stops, village trail, public transportation, road and pedestrian system), common living facilities and common space(number, size, location & placement, plan type, planning type of common facilities), transfer space, individual housing(type, size, planning type). The guideline for the social environment was developed for 3 items; village making and establishment(resident participation type, resident participation tool, residents' construction participation) and resident education in the course of planning, resident participation(gathering resident opinion, decision making, composition of construction committee, community newsletter).

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

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over, setup overlapping, state dependent setup time as well as demand splitting are considered. For this LSSP, we develop a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we develop an efficient heuristic algorithm by combining a decomposition scheme with a local search procedure. Test results show that the developed heuristic algorithm finds a good quality (in practice, even better) feasible solution using far less computation time compared with the CPLEX, a competitive MIP solver.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.409-416
• /
• 2003

We consider the problem of grouping orders into lots. The problem is modelled by a graph G = (V, E). where each node $\nu\;\in\;V$ denotes order specification and its weight $\omega(\nu)$ the orders on hand for the specification. We ran construct a lot simply from orders or single specification For a set of nodes (specifications) $\theta\;\subseteq\;V$, if the distance or any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when d = 2, $\lambda\;=\;3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when d = 1, $\lambda\;=\;3$ and each weight is 1, 2 or 3

• 산업경영시스템학회지
• /
• 제17권32호
• /
• pp.121-126
• /
• 1994

Setup Time Reduction is an important aspect of the Just-in-Time(JIT) and Zero Inventory(Zl) Concepts since it supports reductions in manufacturing lead times and inventories. It also enables small lot sizes and kanban systems implementation for material flow - achieving major improvements in production floor management. One concept fundamental to the pursuit of JIT production in Japan and other countries is adoption of a setup time reduction. This paper looks at the necessities of setup time reduction and the relations to machine utilization. By using an EOQ model for evaluate the effect of setup time reduction, we get the results that over 75 % reduction in setup time is obtain the desired results in the lot size reduction.

• 산업공학
• /
• 제13권2호
• /
• pp.217-224
• /
• 2000

This paper analyzes the effects of setup cost reduction in a dynamic lot-sizing model for a single-facility multi-product problem. In the model, demands for each product are known, no backlogging is allowed, and a single resource is employed. Also, setup cost is defined as a function of capital expenditure to invest in setup cost reduction. Furthermore, in each production period the facility (or plant) produces many products, each representing a fixed part of the involved production activity (or input resource quantity). In this paper, the structure of the optimal solution is characterized and an efficient algorithm is proposed for simultaneously determining the optimal lot size with reduced setup cost and the optimal investment in setup cost reduction. Also, the proposed algorithm is illustrated by a numerical example with a linear and an exponential setup reduction functions.

• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.418-427
• /
• 2016

A smart parking management requires to track a vehicle in a indoor parking lot and to detect the place where the vehicle is parked. An advanced parking system watches all space of the parking lot with CCTV cameras. We can use these cameras for vehicles tracking and detection. In order to cover a wide area with a camera, a fisheye lens is used. In this case the shape and size of an moving vehicle vary much with distance and angle to the camera. This makes vehicle detection and tracking difficult. In addition to the fisheye lens, the vehicle headlights also makes vehicle detection and tracking difficult. This paper describes a method of realtime vehicle detection and tracking robust to the harsh situation described above. In each image frame, we update the region of a vehicle and estimate the vehicle movement. First we approximate the shape of a car with a quadrangle and estimate the four sides of the car using multiple histograms of oriented gradient. Second we create a template by applying a distance transform to the car region and estimate the motion of the car with a template matching method.

• 제어로봇시스템학회논문지
• /
• 제18권9호
• /
• pp.854-862
• /
• 2012

The optimal design of batch-storage network by using periodic square wave model provides analytical lot sizing equations for a complex supply chain network characterized as multi-supplier, multi-product, multi-stage, non-serial, multi-customer, cyclic system including recycling and/or remanufacturing. The network structure includes multiple currency flows as well as material flows. The processes are represented by multiple feedstock/product materials with fixed composition which are very suitable for production processes. In this study, transportation processes that carry multiple materials with unknown composition are added and the time frame is changed from single period into multiple periods in order to represent nonperiodic parameter variations. The objective function of the optimization involves minimizing the opportunity costs of annualized capital investments and currency/material inventories minus the benefit to stockholders in the numeraire currency. The expressions for the Kuhn-Tucker conditions of the optimization problem are reduced to a multiperiod subproblem for average flow rates and analytical lot-sizing equations. The multiperiod lot sizing equations are different from single period ones. The effects of corporate income taxes, interest rates and exchange rates are incorporated.

• 산업기술연구
• /
• 제19권
• /
• pp.301-312
• /
• 1999

The purpose of this paper is to study the effects of container size with multi-stage and multi-item on average inventory and customer service level in Kanban systems. We use the different distributions of demand and interarrival time for each item to show that we had better to change the container size depending on different type of item for this simulation study. The small lot size can be used for container size of a single item if there is no setup time. The container size should be identical with average order size as setup time increases. The fill rate increases if the container size is large with multi-item. However, it is difficult to establish the effective container size because the effects of the container size on the order queue time are not clear. It is suitable to use the average order size as the container size for each item if the variance of demand and interarrival time of each item is relatively small. It is effective to sue the average container size if the variance of them is relatively large.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2002년도 춘계학술대회
• /
• pp.243-247
• /
• 2002

This paper deals with the problem of determining the buyer's economic lot sizing policy for exponentially deteriorating products under trade credit. Assuming that the supplier's credit terms are already known and the length of delay is a function of the buyer's order size, we formulate the mathematical model and the solution algorithm is developed based on the properties of an optimal solution.