• 산업공학
• /
• 제17권3호
• /
• pp.282-293
• /
• 2004

Line Balancing is the problem to assign tasks to stations while satisfying some managerial viewpoints. Most researches about the Mixed-Model Line Balancing problems are focused on the minimizing the total processing time or the number of workstations. Independently, some research reports consider the balance issues of the physical workloads on the assembly line. In this paper, we are presenting a new mathematical model to accomplish the line balance considering both the processing time and the workloads at the same time. To this, end, we propose an zero-one integer program problem, and we use the Chebyshev Goal Programming approach as the solution method. Some computational test runs are performed to compare the pay-offs between the processing time and the workloads. And, the test results show us that the reliable balanced work schedules can be obtained through the proposed model.

• 한국산업정보학회논문지
• /
• 제19권4호
• /
• pp.87-104
• /
• 2014

본 연구에서는 지역적으로 집중화된 역물류네트워크(Regionally centralized multistage reverse logistics network: cmRL)와 지역적으로 분산회된 역물류네트워크(Regionally decentralized multistage reverse logistics network: dmRL)를 제안하고 있다. cmRL과 dmRL 각각은 고려되는 영역 전체와 지역적으로 분산된 세부영역에서의 RL 네트워크로 구성된다. 이들은 혼합정수계획법(Mixed integer programming: MIP) 모델로 공식화되며, 유전알고리즘(Genetic algorithm: GA)을 통해 해를 구하게 된다. 사례연구에서는 두 가지 형태의 RL네트워크를 제시하며 다양한 수행도 척도를 사용하여 cmRL과 dmRL의 효율성을 비교분석하였다. 분석결과 cmRL이 dmRL 보다 더 우수한 수행도를 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2626-2646
• /
• 2014

This study presents a power and Physical Resource Blocks (PRBs) joint allocation algorithm to coordinate uplink (UL) interference in the device-to-device (D2D) underlaying Long Term Evolution-Advanced (LTE-A) networks. The objective is to find a mechanism to mitigate the UL interference between the two subsystems and maximize the weighted sum throughput as well. This optimization problem is formulated as a mixed integer nonlinear programming (MINLP) which is further decomposed into PRBs assignment and transmission power allocation. Specifically, the scenario of applying imperfect channel state information (CSI) is also taken into account in our study. Analysis reveals that the proposed PRBs allocation strategy is energy efficient and it suppresses the interference not only suffered by the LTE-A system but also to the D2D users. In another side, a low-complexity technique is proposed to obtain the optimal power allocation which resides in one of at most three feasible power vectors. Simulations show that the optimal power allocation combined with the proposed PRBs assignment achieves a higher weighted sum throughput as compared to traditional algorithms even when imperfect CSI is utilized.

• 대한산업공학회지
• /
• 제32권1호
• /
• pp.42-50
• /
• 2006

The multi-criteria group decision making (MCGDM) problem is to determine the best compromise solution in a set of competing alternatives that are evaluated under conflicting criteria by decision maker (DM)s. In this paper, we propose a mixed-integer programming (MIP) model to solve MCGDM. The existing method based on minimizing a distance measure such as Median Approach can not guarantee the best compromise solution because the element of median point vector is defined with respect to each criteria separately. However, by considering all criteria simultaneously, we generate median point that is better for locating the best compromise solution. We also utilize the concept of spatial dispersion index (SDI) to produce a threshold value, which is used as a guideline to choose either the Utopian Approach or the Median Approach. And we suggest using CBITP (Convex hull of individual maxima Based Interactive Tchebycheff Procedure) to provide DMs with various Pareto-optimal solutions so that DMs have broad range of selection.

• 대한산업공학회지
• /
• 제20권4호
• /
• pp.51-63
• /
• 1994

Many themes have been studied for FMS problems. But most researches have focused on specific themes; Machine selection, Loading, Routing, Machine layout, etc. So many decision makers who want to introduce FMS to his factory, have many problems, because they do not know either what size of FMS should be introduced or what amount of money should be invested. The objective of this research is to help the decision makers who want to introduce FMS. This research consists of three major part, first, Machine selection, second, Loading, and third, Machine Layout. In the first part of the research, machines are selected with minimum cost satisfying the given demand of each part. In the second part, each operations with its required tools are allocated to those machines. In the third part the locations of each selected machines are determined. And dissimilarity coefficients between each pair of machines are calculated as the measure of distance. With above three steps, we have selected machines, allocated operations to those machines, and the layout configuration of those machines. And for each three steps, Mixed Integer Programming models are formulated. In order to solve the large problems and reduce the computer execution time, three heuristic algorithms are developed for the three mixed integer programming models.

• 대한산업공학회지
• /
• 제32권4호
• /
• pp.382-392
• /
• 2006

Vendor-managed inventory policy(VMIP) is a supply-chain initiative where the supplier is authorized to manage inventories of items at retail locations. In VMIP, the supplier monitors sales and stock information at retail locations and makes decisions of inventory replenishment and transportation simultaneously. VMIP has been known as an effective supply chain strategy that can realize many of benefits obtainable only in a fully integrated supply chain. However, VMIP does not always lead to lower the supply chain cost. It sometimes generates the total supply chain cost higher than the traditional retailer-managed inventory policy (RMIP). In this paper, we perform a comparison study on RMIP and VMIP in the retail supply chain which consists of a single supplier and a number of retailers. We formulate mixed integer programming models for both RMIP and VMIP with vehicle routing problems and perform computational experiments on various test problems. Furthermore, we derive the conditions which guarantee the dominant position for VMIP with respect to total supply chain cost in the simple retail supply chain.

• 정보처리학회논문지C
• /
• 제14C권2호
• /
• pp.179-184
• /
• 2007

이동 통신 시스템의 설계에 있어서 기지국의 위치를 선정하는 문제는 기본적으로 셀 내부 및 외부의 간접전파에 의한 최소 SIR을 만족하면서 최대한의 사용자를 최소의 기지국에 할당하는 문제로서 NP-hard 이다. 기존에 주로 사용된 목적함수는 창고위치문제에서 사용하던 것으로 CDMA 이동통신 시스템으로 직접 이용하는 단계에서 문제점이 발생한다. 그 문제점들을 해결하는 목적함수와 최적해 및 근사해를 구하는 알고리즘을 제안하고, 그에 따른 시뮬레이션을 하여 본 논문의 제안이 타당성이 있는지 평가 및 분석하였다. 본 논문에서는 기지국의 위치문제를 경험적 탐색방법을 사용하지 않고 혼합정수계획법의 완전해를 이용하여 최적해 및 근사해를 구하였다.

• 대한산업공학회지
• /
• 제38권1호
• /
• pp.57-66
• /
• 2012

The paper deals with the development of a model for group decision making under multiple criteria. The Multi-criteria group decision making (MCGDM) is the process to determine the best compromise solution in a set of competing alternatives that are evaluated by decision makers having their own preferences on conflicting objectives. For MCGDM, we propose a Mixed-Integer Programming (MIP) model that implements a revised median approach by noticing that the original median approach cannot consider the willingness to reject and the indifferent preference conditions. The proposed MIP model tries to select a common best Pareto-optimal solution by maximizing the overall desirability considering the willingness to reject and the indifferent preference that represent the tolerance measure of each decision maker. To evaluate the effectiveness of the proposed model, we compared the results of the proposed model with those of the median approach. The results showed that the proposed MIP model produces more realistic and better compromised alternative by incorporating the decision maker's willingness to reject and the indifferent preferences over each criteria.

• 한국철도학회논문집
• /
• 제12권6호
• /
• pp.1018-1023
• /
• 2009

본 연구는 도시철도 시스템에서 동일시간에 동력운전하는 열차수를 최소화하여 전기에너지소모의 최대치를 최소화하고자 한다. 이를 위하여 열차동력운전 분산 열차 시각표 작성에 대한 문제를 정의하였다. 정의된 문제를 혼합정수계획(Mixed Integer Programming)모형으로 정식화하고 문제의 해법으로 상용소프트웨어를 활용한 해법과 휴리스틱 해법 두 가지를 제시하였다. 실제 열차시각표에 적용하여 동시 동력운전 열차수를 25% 감소시켰으며 본 연구결과의 유용성을 확인하였다. 이를 통하여 기존 시각표의 서비스품질을 악화시키지 않는 에너지 효율적 열차시각표를 작성하였다.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.40-48
• /
• 2009

In this article, scheduling of a casting sequence is studied in a casting foundry which must deliver products according to the Just-in-time(JIT) production policy of a customer. When a foundry manufactures a variety of casts with an identical alloy simultaneously, it frequently faces the task of production scheduling. An optimal casting schedule should be emphasized in order to maximize the production rate and raw material efficiency under the constraints of limited resources; melting furnaces and operation time for a casting machine. To solve this practical problem-fulfilling the objectives of casting the assigned mixed orders for the highest raw material efficiency in a way specified by the customer's JIT schedule, we implement simple integer programming. A simulation to solve a real production problem in a typical casting plant proves that the proposed method provides a feasible solution with a high accuracy for a complex, multi-variable and multi-constraint optimization problem. Employing this simple methodology, a casting foundry having an automated casting machine can produce a mixed order of casts with a maximum furnace utilization within the due date, and provide them according to their customer's JIT inventory policy.