• 제목/요약/키워드: Time Guarantee Decisions

검색결과 13건 처리시간 0.035초

연속적 근사법에 의한 물류시스템의 경쟁적 시간보장 의사결정 최적화에 관한 연구 (The Competitive Time Guarantee Decisions Via Continuous Approximation of Logistics Systems)

  • 김형태
    • 산업경영시스템학회지
    • /
    • 제37권3호
    • /
    • pp.64-74
    • /
    • 2014
  • We show how a supplier can peg cost measures to the reliability of his time guarantees via the penalty costs considered in the framework. The framework also enables us to study the connections between the logistics network and the market. In this context, we show that even when the market base increases significantly, the supplier can still use the logistics network designed to satisfy lower demand density, with only a marginal reduction in profit. Finally we show how the framework is useful to evaluate and compare various logistics system improvement strategies. The supplier can then easily choose the improvement strategy that increases his profit with the minimal increase in his logistics costs.

유전 알고리즘을 이용한 생산 및 분배 계획 (A study on production and distribution planning problems using hybrid genetic algorithm)

  • 정성원;장양자;박진우
    • 한국경영과학회지
    • /
    • 제26권4호
    • /
    • pp.133-141
    • /
    • 2001
  • Rapid development in computer and network technology these days has created in environment in which decisions for manufacturing companies can be made in a much broader perspective. Especially, better decisions on production and distribution planning(PDP) problems can be made laking advantage of real time information from all the parties concerned. However, since the PDP problem-a core part of the supply chain management- is known to be the so-called NP-hard problem, so heuristic methods are dominantly used to find out solutions in a reasonable time. As one of those heuristic techniques, many previous studios considered genetic a1gorithms. A standard genetic a1gorithm applies rules of reproduction, gene crossover, and mutation to the pseudo-organisms so the organisms can pass along beneficial and survival-enhancing trails to a new generation. When it comes to representing a chromosome on the problem, it is hard to guarantee an evolution of solutions through classic a1gorithm operations alone, for there exists a strong epitasis among genes. To resolve this problem, we propose a hybrid genetic a1gorithm based on Silver-Meal heuristic. Using IMS-TB(Intelligent Manufacturing System Test-bed) problem sets. the good performance of the proposed a1gorithm is demonstrated.

  • PDF

An Integer Programming Formulation for Outpatient Scheduling with Patient Preference

  • Wang, Jin;Fung, Richard Y.K.
    • Industrial Engineering and Management Systems
    • /
    • 제13권2호
    • /
    • pp.193-202
    • /
    • 2014
  • Patients' satisfaction while receiving medical service is affected by whether or not their preferences can be met, including time and physician preference. Due to scarcity of medical resource in China, efficient use of available resources is urgently required. To guarantee the utilization ratio, the scheduling decisions are made after all booking information is received. Two integer models with different objectives are formulated separately, maximizing the degree of satisfaction and revenue. The optimal value of the two models can be considered as the bound of corresponding objectives. However, it is improper to implement any of the extreme policies. Because revenue is a key element to keep the hospital running and satisfaction degree is related to the hospital's reputation, neither the revenue nor the satisfaction can be missed. Therefore, hospitals should make a balance. An integrated model is developed to find out the tradeoff between the two objectives. The whole degree of mismatching that is related to patient satisfaction and other separate mismatching degree are considered. Through a computational study, it is concluded that based on the proposed model hospitals can make their decisions according to service requirement.

계층적 분석기법을 활용한 그룹의사결정 지원 (Group Decision Support with Analytic Hierarchy Process)

  • 안병석
    • 한국국방경영분석학회지
    • /
    • 제28권1호
    • /
    • pp.83-96
    • /
    • 2002
  • The Analytic Hierarchy Process (AHP) is well suited to group decision making and offers numerous benefits as a synthesizing mechanism in group decisions. To date, the majority of AHP applications have been in group settings. One reason for this may be that groups often have an advantage over individual when there exists a significant difference between the importance of quality in the decision and the importance of time in which to obtain the decision. Another reason may be the best alternative is selected by comparing alternative solutions, testing against selected criteria, a task ideally suited for AHP. In general, aggregation methods employed in group AHP can be largely classified into two methods: geometric mean method and (weighted) arithmetic mean method. In a situation where there do not exist clear guidelines for selection between them, two methods do not always guarantee the same group decision result. We propose a simulation approach for building group consensus without efforts to make point estimates from individual diverse preference judgments, displaying possible disagreements as is natural in group members'different viewpoints.

음성/데이터 통합 이동통신시스템에서의 서비스 품질을 고려한 가격결정모델 (Pricing Decisions to Control Quality-of-Service in Integrated Voice/Data Mobile Communication System)

  • 김환선
    • 한국통신학회논문지
    • /
    • 제29권10B호
    • /
    • pp.866-879
    • /
    • 2004
  • 본 연구논문에서는 소비자의 서비스 품질에 따른 지불의사를 고려하여 음성/데이터 통합 이동통신서비스 제공업자의 수익을 극대화시키는 최적 가격을 결정하는 모델을 제시한다. 특히 고려되는 음성서비스 및 데이터서비스의 가격방식은 현재 우리나라 이동통신서비스의 회선요금제와 패킷요금제를 각각 적용한다. 이 모델은 소비자들이 핸드오프도중 발생하는 통화단절에 매우 민감하게 반응한다는 가정하에, 기지국이 무선채널을 할당함에 있어서 핸드오프 트래픽만이 독점사용할 수 있는 가드채널을 할당하는 방안을 고려하며, 더불어 서비스제공업자가 통화단절율의 서비스 품질을 소비자군에게 보장하는 경우를 고려한다. 궁극적으로 이 모델은 단기적으로 가격전략 및 무선채널 할당정책에 의존하여 서비스 품질을 개선$.$보장할 수 있는 방안을 제시하며, 그 결과 시스템자원의 확충없이는 수익과 서비스 품질의 개선$.$보장간에 상충관계가 존재함을 보여준다.

비작업보존 스케줄러를 갖는 IEEE 802.1 TSN에서 단대단 지연시간 보장 (End-to-end Delay Guarantee in IEEE 802.1 TSN with Non-work conserving scheduler)

  • 정진우
    • 한국인터넷방송통신학회논문지
    • /
    • 제18권6호
    • /
    • pp.121-126
    • /
    • 2018
  • IEEE 802.1 TSN(Time Sensitive Network) TG(Task Group)는 이더넷을 기반으로 지연시간 보장 및 패킷 무손실 서비스를 제공하는 기술의 표준화를 진행 중이다. 본 연구는 다양한 TSN 기술 중 패킷 포워딩 기술에 주목한다. TSN의 포워딩 기술은 크게 동기형과 비동기형으로 구분할 수 있다. 동기형은 시간 동기화 기술을 바탕으로 정해진 시간 구간을 정해진 class에 할당하는 기술이지만 대규모 네트워크에서 사용하기 어렵다. 비동기 기술은 트래픽 regulation과 class 별 스케줄링을 바탕으로 지연시간 보장을 약속하지만 필요 이상으로 복잡한 구조를 가진다. 본 논문에서는 비동기형 TSN 네트워크 구조를 보다 간단히 만들면서도 지연시간을 보장하는 방안을 제시하였다. 이를 통해 플로우의 상태를 저장하여 regulation 결정에 사용해야 하는 복잡성을 배제할 수 있었다. 이러한 간단한 구조에도 불구하고 높은 우선순위 트래픽의 최대 패킷길이를 일정 수준 이하로 제한하면 TSN의 요구사항을 만족시킴을 보였다.

노인의 자녀와 동거희망과 지속거주희망에 영향을 미치는 요인 - 초고령노인기를 가정하여 - (A Study on the Factors Affecting Decisions by the Super-Aged on Their Preference of Living with Their Children and Continuously Living in Their Current Houses)

  • 곽인숙
    • 한국주거학회논문집
    • /
    • 제22권6호
    • /
    • pp.83-95
    • /
    • 2011
  • This study was conducted to guarantee elderly housing for the increasing number of elderly people over 85. It examined their preference of living with their children and continuously living in their current houses when they reach the age of 85. First, research shows that 69.8% of the elderly wish to live separately from their children in later years. Second, 61.9% of the elderly wish to continue to live in their current houses. Third, the elderly without a spouse, with lower levels of education and with a longer period of time in their current houses, prefer to live with their children. Fourth, the elderly who own a house, who have lived in their current house for a long time, who have a religion and who are satisfied with their houses, wish to continue to live in their current houses in later years. However, most of the houses have safety defects such as a difference of floor-level at the entryway, lack of gas and smoke detectors and slippery bathroom floors. Thus, the elderly need to be supported by providing proper housing renovations for their safety and wellbeing.

An Improved Genetic Approach to Optimal Supplier Selection and Order Allocation with Customer Flexibility for Multi-Product Manufacturing

  • Mak, Kai-Ling;Cui, Lixin;Su, Wei
    • Industrial Engineering and Management Systems
    • /
    • 제11권2호
    • /
    • pp.155-164
    • /
    • 2012
  • As the global market becomes more competitive, manufacturing industries face relentless pressure caused by a growing tendency of greater varieties of products, shorter manufacturing cycles and more sophisticated customer requirements. Efficient and effective supplier selection and order allocation decisions are, therefore, important decisions for a manufacturer to ensure stable material flows in a highly competitive supply chain, in particular, when customers are willing to accept products with less desirable product attributes (e.g., color, delivery date) for economic reasons. This paper attempts to solve optimally the challenging problem of supplier selection and order allocation, taking into consideration the customer flexibility for a manufacturer producing multi-products to satisfy the customers' demands in a multi period planning horizon. A new mixed integer programming model is developed to describe the behavior of the supply chain. The objective is to maximize the manufacturer's total profit subject to various operating constraints of the supply chain. Due to the complexity and non-deterministic polynomial-time (NP)-hard nature of the problem, an improved genetic approach is proposed to solve the problem optimally. This approach differs from a canonical genetic algorithm in three aspects: a new selection method to reduce the chance of premature convergence and two problem-specific repair heuristics to guarantee feasibility of the solutions. The results of applying the proposed approach to solve a set of randomly generated test problems clearly demonstrate its excellent performance. When compared with applying the canonical genetic algorithm to locate optimal solutions, the average improvement in the solution quality amounts to as high as ten percent.

1인 창조기업의 손익분기점 도달 영향요인 분석 (Analysis on Factors Influencing the Achievement of Break-even Point among the Creativity and Skill-based Sole Proprietors)

  • 김선영;이병헌
    • 아태비즈니스연구
    • /
    • 제12권1호
    • /
    • pp.151-163
    • /
    • 2021
  • Purpose - The break-even point refers to the point where total profit and total cost coincide, and from this point on, the entrepreneur's decision-making takes a different route. Strategic decisions can be made for more efficient operation and eventually for more likelihood for growth and sustainability if a startup figures out when it recoups the investment and switches to a net profit. Design/methodology/approach - 748 creativity and skill-based sole proprietors in manufacturing industry were examined to demonstrate the effect of the entrepreneur's entrepreneurial experience and education level, the business launch preparation time, or the self-financing on the achievement of break-even point. Findings - While the business launch preparation time lowered the likelihood of reaching a break-even point, self-financing increased the likelihood. As a result of further analysis by subdividing into subgroups according to skill level, only the business launch preparation time was statistically significant in the highly skilled industries. In the low skilled industries, in addition to the business launch preparation time, the CEO's education level and the self-financing were statistically significant. Research implications or Originality - The longer the business launch preparation time, the higher the start-up cost, which increases the burden of initial cost recovery, and the agile response to market changes is thereby delayed, resulting in the business idea losing its appeal. Self-financing not only provides stability and strong motivation for the business operation but also promotes careful spending which contributes to the achievement of break-even point. In particular, it is found that practical experience is more useful than theoretical knowledge in low skilled industries. Due to the limitation of secondary data based on the recollection, the time required to reach a break-even point, percentage of financing sources, etc. may include cognitive errors. In addition, variables are not included that explain the characteristics of creativity and skill-based sole proprietorship, so it is necessary to exercise caution with the actual application.

블록체인 기술 기반의 주주총회 전자투표에 관한 연구 (A Study of Blockchain Technology-based Electronic Voting in Shareholders' Meeting)

  • 김석;진성광;김혜경;최정일
    • 한국IT서비스학회지
    • /
    • 제19권3호
    • /
    • pp.101-115
    • /
    • 2020
  • Electronic voting is one of information technology service to handle a wide range of functions, including registration, certification, input and results of voting, using electronic technology, depending on the degree of automation. It helps voters exercise their voting rights not only for individual suffrage but also for major corporate decisions as shareholders by expressing their opinions regardless of geographical and time constraints. Such electronic voting helps open and expand voting participation, but on the contrary, it is possible to identify who voted and what kind of vote, such voting cannot guarantee confidentiality. Therefore, if blockchain technology is applied to electronic voting, it can increase the speed of processing and confidentiality by encrypting voting information. In this regard, the study aims to identify institutional issues on how electronic voting can be activated at a company's shareholders' meeting, and to find ways to overcome the limitations of existing electronic voting by utilizing the technical characteristics of blockchain. This study proposes a consortium-type blockchain-based electronic voting system to enhance the convenience and reliability of electronic voting for shareholders' meetings. In addition, this paper suggests how to enhance shareholders' profits through electronic voting at shareholders' meetings, as well as its policy measures and future improvements.