• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.195-204
• /
• 2003

Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

• 산업공학
• /
• 제20권3호
• /
• pp.277-287
• /
• 2007

Semiconductor manufacturing is one of the most complex and capital-intensive processes composed of several hundreds of operations. In today’s competitive business environments, it is more important than ever before to manage manufacturing process effectively to achieve better performances in terms of customer satisfaction and productivity than those of competitors. So, many semiconductor manufacturing companies implement advanced planning and scheduling (APS) system as a management tool for the complex semiconductor manufacturing process. In this study, we explain roles of production planning and scheduling in semiconductor manufacturing and principal factors that make the production planning and scheduling more difficult. We describe the APS system implementation project at Korean semiconductor manufacturing company in terms of key issues with realistic samples.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• Journal of Preventive Medicine and Public Health
• /
• 제19권1호
• /
• pp.56-64
• /
• 1986

This paper describes a GPSS-based, multi-server queueing model that was developed to simulate the patient flow, and to analyze the effectiveness of the patient scheduling system under various conditions. Unpredictable and unacceptably long waits to receive the service at the outpatient department of a general hospital necessitated the study. Arrival and service time distribution needed for the simulation model were generated from actual arrival and service patterns observed during the peak hours. The simulation results show that a change in patient scheduling system (i.e. time interval between appointments, starting time. and the number of physicians) from a current system would significantly reduce the patient wait time. This study provides the hospital administrator with an analysis of patient scheduling system under several conditions, and will be used to plan future scheduling system and staffing. Studies such as this can demonstrate the value of simulation in providing information for use in future planning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4429-4445
• /
• 2019

As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.20-23
• /
• 2003

The logic-based scheduling languages RSV and RCPSV may be used to represent and to solve a new general class of resource-constrained project scheduling with variants. RSV and RCPSV syntactically represent schedul7ing problems as descriptions (activity terms) being similar to concepts in a description logic. Though RSV and RCPSV have a different syntax, they are equal1y expressive. On the other hand, from a complexity point of view RCPSV permits more compact representations than RSV. We argue that the difference may be exponential.

• 한국항행학회논문지
• /
• 제15권5호
• /
• pp.764-773
• /
• 2011

IEEE 802.15.4는 TDMA(time division multiple access) 방식으로 동작하는 LWPAN(low-rate wireless personal area networks)의 표준이다. 그러나 IEEE 802.15.4는 QoS(quality of service), 확장성, 신뢰성 등에 제약이 있다. 기존 IEEE 802.15.4에서는 QoS 지원을 위하여 GTS(guaranteed time slot)을 사용한다. 그러나 GTS는 멀티 홉 환경에서 다수의 장치들의 QoS를 만족시키기에 효과적인 방법이 아니며, 멀티 주파수 채널에 대한 고려도 없다. 이러한 제약 사항을 보완하기 위하여 IEEE 802.15.4의 MAC(medium access control) 부계층을 강화한 표준으로써 IEEE 802.15.4e가 개발 중이다. 본 논문에서는 IEEE 802.15.4e에서 멀티 채널, 멀티 홉 환경의 종단 장치간 전송 지연을 만족시키기 위한 스케줄링 방식을 제안하고, 시뮬레이터를 이용하여 성능 평가를 수행하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.1045-1046
• /
• 2006

The IEEE 802.11e medium access control (MAC) is an emerging standard to support Quality of Service (QoS). A HCCA (HCF controlled channel access) scheduler of the standard IEEE 802.11e is only efficient for flows with strict constant bit rate (CBR) characteristics. In this paper, we propose a new HCCA scheduling scheme that aims to be efficient for both CBR and VBR flows. The proposed scheme uses fuzzy queue length predictions to tune its time allocation to stations. We present a set of simulations and provide performance comparisons with the reference HCCA scheduler.

• Management Science and Financial Engineering
• /
• 제10권2호
• /
• pp.1-28
• /
• 2004

The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.

• 대한전자공학회논문지TC
• /
• 제44권10호
• /
• pp.99-109
• /
• 2007

무선랜에서 QoS를 지원하기 위해 제안된 IEEE 802.l1e의 HCCA (HCF Controlled Channel Access)는 폴링에 의한 채널 제어 방식이다. 즉 HCCA는 중앙 제어 방식이기 때문에 자원을 분배하기 위한 스케줄링 알고리즘이 필요하며 IEEE 802.11e 표준에는 Reference 스케줄러가 제시되어 있다. Reference 스케줄러븐 폴링 리스트에 있는 모든 스테이션들을 동일한 주기로 폴링하기 때문에 잦은 폴링으로 인해 오버헤드 면에서 비효율적이며, TXOP (Transmission Opportunity)의 활용률 면에서도 낮다. 본 논문에서는 이러한 단점을 극복하고자 스테이션들의 MSI (Maximum Service Interval)에 따라 폴링 주기를 단계별로 나누어서 스케줄링하기 위한 트래픽 스케줄링 및 수락 제어 (admission control) 알고리즘을 제안한다. 제안하는 알고리즘에서는 스테이션들이 자시의 MSI와 가능한 비슷한 주기로 폴링되기 때문에 Reference 스케줄러에 비해 폴링 오버헤드가 감소하게 되며, TXOP 활용률도 증가하게 된다. 시뮬레이션을 통한 Reference 스케줄러와의 성능 비교는 제안된 알고리즘이 전체적인 전송률 면에서 더 높은 성능을 보이고 더 많은 수의 스테이션이 서비스가 가능함을 보여준다.