• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.206-214
• /
• 2016

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.1
• /
• pp.47-53
• /
• 2012

Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.

• Food Engineering Progress
• /
• v.13 no.1
• /
• pp.70-73
• /
• 2009

The yield stress of stirred yogurt was measured by the vane viscometer at different pre-shearing conditions, such as pre-shear speed, pre-shear time, and wait time, and temperature (12-38${^{\circ}C}$). The yield stress ranged from ~17.6 to 10 Pa and from 34.2 to 11.9 Pa, depending on the pre-shearing conditions and temperature, respectively. The preshear speed and the wait time significantly affected the yield stress. The temperature dependence of the yield stress was described by the Eyring's kinetic model. The linear function of the temperature on the yield stress was limited at the 22${^{\circ}C}$, and at the above 22${^{\circ}C}$, the yield stress was maintained to be a constant (~12.5 Pa).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2029-2046
• /
• 2016

Energy consumption is an important index in mobile ad hoc networks. Data packet transmission increases among nodes, particularly in big data communication. However, nodes may be unable to transmit data packets because of energy over-consumption. Consequently, information may be lost and network communication may block. While opportunistic network is a kind of mobile ad hoc networks, researchers do not focus on energy consumption in opportunistic network communication. This study proposed an effective sensor energy supply scheme that can be applied in opportunistic networks. This scheme considers nodes sensor requests and communication model. In this scheme, nodes do not only accomplish energy supply in communication, but also extend communication time in opportunistic networks. Compared with the Spray and Wait algorithm and the Binary Spray and Wait algorithm in simulations, the proposed scheme extends communication time, increases data packet transmission, and accomplishes energy supply among nodes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.5
• /
• pp.181-188
• /
• 2008

E-Science Grid is designed to cope with computation-intensive tasks and to manage a huge volume of science data efficiently. However, certain tasks may involve more than one grid can offer in computation capability or incur a long wait time on other tasks. Resource sharing among Grids can solve this problem with proper processing-integrity check via audit. Due to their computing-intensive nature, the processing time of e-Science tasks tends to be long. This potential long wait before an audit failure encourages earlier audit mechanism during execution in order both to prevent resource waste and to detect any problem fast. In this paper, we propose a Light-weight, Adaptive and Reliable Audit, LARA, of processing Integrity for e-Science applications. With the LARA scheme. researchers can verify their processing earlier and fast.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.45 no.9
• /
• pp.775-783
• /
• 2017

In this paper, an impulsive rendezvous problem by using minimum energy of spacecraft in different orbits is addressed. In particular, the orbits considered in this paper are the general orbits including the elliptic orbit, while most of the orbits considered in the literature have been restricted within co-planar or circular orbits. The constraints for solving this optimization problem are the Kepler's equation formulated with the universal variable, and the final position and velocity of two spacecraft. Also, the Lagrange coefficients, sometimes called as f and g solution, are used to describe the orbit transfer. The proposed method technique is demonstrated through numerical simulation by considering the minimum energy, and both the minimum energy and the wait time, respectively. Finally, it is also verified by comparing with the Hohmann transfer known as the minimum energy trajectory. Although a closed-form solution cannot be obtained, it shows that the suggested technique can provide a new insight to solve various orbital transfer problems.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.14
• /
• pp.5901-5908
• /
• 2014

Background: Data from BreastScreen Australia Screening and Assessment Services (SAS) for 2002-2010 were analysed to determine whether some SAS characteristics were more conducive that others to high screening performance, as indicated by high priority performance indicators and standards. Materials And Methods: Indicators investigated related to: numbers of benign open biopsies, screen-detected invasive cancers, and interval cancers, and wait times between screening and assessment. Multivariate Poisson regression was undertaken using as candidate predictors of performance, SAS size (screening volume), urban or rural location, year of screening, accreditation status, and percentages of clients from culturally and linguistically diverse backgrounds, rural and remote areas, and socio-economically disadvantaged areas. Results: Performance standards for benign biopsies and invasive cancer detection were uniformly met irrespective of SAS location and size. The interval cancer standard was also met, except in 2003 when the 95% confidence interval of the rate still incorporated the national standard. Performance indicators improved over time for: benign open biopsy for second or subsequent screening rounds; rates of invasive breast cancer detection for second or subsequent screening rounds; and rates of small cancer detection. No differences were found over time in interval cancer rates. Interval cancer rates did not differ between non-metropolitan and metropolitan SAS, although state-wide SAS had lower rates. The standard for wait time between screening and assessment (being assessed ${\leq}28$ days) was mostly unmet and this applied in particular to SAS with high percentages of culturally and linguistically diverse women in their screening populations. Conclusions: Gains in performance were observed, and all performance standards were met irrespective of SAS characteristics, except wait times to assessment. Additional descriptive data should be collected on SAS characteristics, and their associations with favourable screening performance, as these may be important when deciding on SAS design

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• Asia Marketing Journal
• /
• v.12 no.1
• /
• pp.1-30
• /
• 2010

Customers often experience waiting for buying service. Managing customers' waiting time is important for service providers since customers who are dissatisfied with waiting, secede from a service place at last. Not a few studies have been done to solve waiting time problem and improve customers' waiting experience. Hui & Tse(1996) identify evaluation factors in customers' behavioral mechanism as customers wait. That is, customers experience perceived waiting time, waiting acceptability and emotional response to the wait when they wait. Since customers evaluate the wait using these factors, service provider should manage these factors in order to minimize customers' dissatisfaction. Therefore, this study explores that evaluation factors of waiting are influenced by customers' situational and experiential characteristics, which include customer loyalty, transaction importance for customer and waiting expectation level. Those situational and experiential characteristics are usually given to service providers so they can't control these at waiting point. The major findings derived from two exploratory studies can be summarized as follows. First, according to the result from the study 1 (restaurant setting), customers' transaction importance has the greatest positive influence on waiting experience. The results show restaurant service provider could prevent customers' separation effectively through strategies which raise customers' transaction importance, like giving special coupons for important events. Second, in study 2 (amusement part setting) customer loyalty has large positive impact on waiting experience as well as transaction importance. This results show that service provider could minimize customers' dissatisfaction using strategies which raise customer loyalty continuously. This results show customer perceives waiting experience differently according to characteristics of service place and service itself. Therefore, service provider should grasp the unique customers' situational and experiential characters for each service and service place. It could provide an effective strategy for waiting time management. Third, the study finds transaction importance and waiting expectation level have direct influence customers' waiting experience as independent variables, while existing studies treated them as moderators. Customer loyalty which has not been incorporated in previous waiting time research is known to affect waiting experience. It suggests that marketing strategy which builds up customer loyalty for long period of time is also quite effective, compared to short term tactics to help customers endure waiting time. Fourth, this study reveals the importance of actual waiting time along with perceived waiting time. So far most studies only focus on customers' perceived waiting time. Especially, this study incorporates the concept of patient limit on waiting time to investigate effect of actual waiting time. The results show that there were various responses to the wait depending on how actual waiting time exceeds individual's patent limit on waiting time or not, even though customers wait about the same period of time. Finally, using structural equation model, conceptual path between behavioral responses is verified. As customer perceives waiting time, then she decides whether she can endure it or not, and then her emotional response occurs. This result are somewhat different from Hui & Tse(1996)'s study. The study also includes theoretical contributions as well as practical implications.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.174-179
• /
• 2005

In the SONET/SDH based ASON, one VC3 connection contains 21 VC12 calls. Hence, it can serve up to 21 VC12 calls. When a new VC12 call arrives, if there exists at least one available VC3 connection in the network, that VC12 call is severed immediately. However, if there is no available VC3 connection, that VC12 call has to wait a certain time, called setup latency, for the a new VC3 connection to be established. This is inconvenient for the customers. On the other hand, if there are more VC3 connections than the network requires, this can waste network resources. In this paper, we proposed the solution for these problems. In order to reduce the number of VC12 calls which have to wait, we setup a new VC3 before all VC12 time slots are occupied. Furthermore, to avoid the waste of the network resources, we do not establish all VC3 connections at the same time, but do establish step by step.