• Title/Summary/Keyword: no-wait.

Search Result 54, Processing Time 0.028 seconds

NO-WAIT OR NO-IDLE PERMUTATION FLOWSHOP SCHEDULING WITH DOMINATING MACHINES

  • WANG JI BO;XIA ZUN QUAN
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.419-432
    • /
    • 2005
  • In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.

No-Wait Lot-Streaming Flow Shop Scheduling (비정체 로트 - 스트리밍 흐름공정 일정계획)

  • Yoon, Suk-Hun
    • IE interfaces
    • /
    • v.17 no.2
    • /
    • pp.242-248
    • /
    • 2004
  • Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

  • Nagano, Marcelo Seido;Miyata, Hugo Hissashi
    • 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.

An Efficient Routing Algorithm for extreme networking environments (극단적인 네트워크 환경을 위한 효율적인 라우팅 알고리즘)

  • Wang, Jong Soo;Seo, Doo Ok
    • 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.

A Systematic Review and Meta-analysis of Manual Therapy for Temporomandibular Disorder (턱관절장애에 대한 수기요법의 체계적 문헌 고찰과 메타분석)

  • Kim, Hong-Guk;Ryoo, Dek-Woo;Jeong, Seong-Mok;Kim, Sung-Jin;Baek, Seung-Won;Lee, Chang-Hee;Yoon, Jin-Young
    • The Journal of Churna Manual Medicine for Spine and Nerves
    • /
    • v.12 no.1
    • /
    • pp.13-27
    • /
    • 2017
  • Objectives: To evaluate and summarize the efficacy and safety of manual therapy in temporomandibular disorder(TMD). Methods: Ten databases (Pubmed, Cochrane, EMBASE, AMED, CINAHL, CNKI, and four Korean databases) were searched up to March 2017. Pain and range of motion(ROM) of temporomandibular joint were used as the primary outcome measure, and effective rates, dysfunction scale and adverse events were used as secondary outcome measures. The Cochrane risk of bias tool was used to evaluate the methodological quality. Results: 10 randomized controlled trials(RCTs) involving 603 participants were included. There were no significant differences between the two groups in comparison with placebo manual therapy group. In comparison with Wait-list and conventional treatment groups, manual therapy significantly alleviated pain and ROM. Five RCTs(50.0%) reported adverse events and there were no adverse cases by manual therapy. Conclusions: We found evidence that manual therapy may alleviate symptoms of patients with TMD. A positive effect was observed in comparison with conventional treatment and Wait-list, but no conclusion for the comparisons with placebo manual therapy. There is no evidence of worsening symptoms or causing adverse events.

  • PDF

The Effect of Location of Waiting Place on Consumers' Perceived Waiting Time in a Family Restaurant (레스토랑의 대기 장소의 위치가 고객의 대기시간 지각에 미치는 영향)

  • PARK, Eun-Young
    • Journal of Distribution Science
    • /
    • v.17 no.6
    • /
    • pp.77-84
    • /
    • 2019
  • Purpose - Although an extensive body of research in psychology and marketing focuses on perceived waiting time, no research has examined the effect of the location of the waiting place on perceived waiting time. In particular, this study suggests that customers who are waiting in a restaurant may have different perceived waiting time depending on whether they are in close proximity to the service area (e.g., dining area) or farther from it. In particular, the author examines how and why the location of the waiting place affects the perceived waiting time of the consumer and reveals the mental simulation as its psychological mechanism. Research design, data, and methodology - This study conducted field surveys with customers waiting in real restaurants. Eighty-eight people participated under two conditions: a restaurant with a waiting place near the dining area and a restaurant with a waiting place far from the dining area. Participants responded to questions about perceived waiting time (the dependent variable), mental simulation (the mediator), and demographic variables. To verify the hypothesis, ANOVA and bootstrapping analysis were performed. Results - The major results from the field study are as follows. First, participants perceived wait time differently depending on the location of the restaurant's waiting place: participants in the restaurant with a waiting place close to the dining area perceived significantly shorter waiting times. Second, the effect of the location of the waiting place on the perceived waiting time was mediated by mental simulation: the closer the wait location is to the dining area, the more imagination the customer exercises about the meal, which in turn distracts attention from time flow and shortens the perceived wait time. Conclusion - This study has a theoretical implication in that it extends research on perceived waiting time as the first study of how and why the location of a waiting place affects a customer's perceived waiting time. It has a practical implication that can be used as a marketing tactics to improve the image of the service provider by changing the location of the waiting place.

Influence of Service Characteristics on High Priority Performance Indicators and Standards in the BreastScreen Australia Program

  • Roder, David Murray;Ward, Gail Heather;Farshid, Gelareh;Gill, Peter Grantley
    • 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

Effects of Simulation on Nursing Students' Knowledge, Clinical Reasoning, and Self-confidence: A Quasi-experimental Study

  • Kim, Ji Young;Kim, Eun Jung
    • Korean Journal of Adult Nursing
    • /
    • v.27 no.5
    • /
    • pp.604-611
    • /
    • 2015
  • Purpose: Knowledge, clinical reasoning, and self-confidence are the basis for undergraduate education, and determine students' level of competence. The purpose of this study was to assess the effects of the addition of a one-time simulation experience to the didactic curriculum on nursing students' knowledge acquisition, clinical reasoning skill, and self-confidence. Methods: Using a quasi-experimental crossover design consisted of intervention and wait-list control groups. Participants were non-randomly assigned to the first intervention group (Group A, n=48) or the wait-list control group (Group B, n=46). Knowledge level was assessed through a multiple choice written test, and clinical reasoning skill was measured using a nursing process model-based rubric. Self-confidence was measured using a self-reported questionnaire. Results: Results indicated that students in the simulation group scored significantly higher on clinical reasoning skill and related knowledge than those in the didactic lecture group; no difference was found for self-confidence. Conclusion: Findings suggest that undergraduate nursing education requires a simulation-based curriculum for clinical reasoning development and knowledge acquisition.

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

An Experiment on On-Demand Circuit Provisioning in SONET/SDH ASON Networks (지능형 광 전달망에서의 on-demand 회선 생성 성능 분석 실험)

  • Nga, Kinh Thi Thuy;Kim, Byung-Jae;Lee, Yong-Gi;Kang, Min-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 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.

  • PDF