Search results for: surgical case scheduling
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 12049

Search results for: surgical case scheduling

11989 Pre- and Post-Analyses of Disruptive Quay Crane Scheduling Problem

Authors: K. -H. Yang

Abstract:

In the past, the quay crane operations have been well studied. There were a certain number of scheduling algorithms for quay crane operations, but without considering some nuisance factors that might disrupt the quay crane operations. For example, bad grapples make a crane unable to load or unload containers or a sudden strong breeze stops operations temporarily. Although these disruptive conditions randomly occur, they influence the efficiency of quay crane operations. The disruption is not considered in the operational procedures nor is evaluated in advance for its impacts. This study applies simulation and optimization approaches to develop structures of pre-analysis and post-analysis for the Quay Crane Scheduling Problem to deal with disruptive scenarios for quay crane operation. Numerical experiments are used for demonstrations for the validity of the developed approaches.

Keywords: disruptive quay crane scheduling, pre-analysis, post-analysis, disruption

Procedia PDF Downloads 194
11988 A Systematic Review of Patient-Reported Outcomes and Return to Work after Surgical vs. Non-surgical Midshaft Humerus Fracture

Authors: Jamal Alasiri, Naif Hakeem, Saoud Almaslmani

Abstract:

Background: Patients with humeral shaft fractures have two different treatment options. Surgical therapy has lesser risks of non-union, mal-union, and re-intervention than non-surgical therapy. These positive clinical outcomes of the surgical approach make it a preferable treatment option despite the risks of radial nerve palsy and additional surgery-related risk. We aimed to evaluate patients’ outcomes and return to work after surgical vs. non-surgical management of shaft humeral fracture. Methods: We used databases, including PubMed, Medline, and Cochrane Register of Controlled Trials, from 2010 to January 2022 to search for potential randomised controlled trials (RCTs) and cohort studies comparing the patients’ related outcome measures and return to work between surgical and non-surgical management of humerus fracture. Results: After carefully evaluating 1352 articles, we included three RCTs (232 patients) and one cohort study (39 patients). The surgical intervention used plate/nail fixation, while the non-surgical intervention used a splint or brace procedure to manage shaft humeral fracture. The pooled DASH effects of all three RCTs at six (M.D: -7.5 [-13.20, -1.89], P: 0.009) I2:44%) and 12 months (M.D: -1.32 [-3.82, 1.17], p:0.29, I2: 0%) were higher in patients treated surgically than in non-surgical procedures. The pooled constant Murley score at six (M.D: 7.945[2.77,13.10], P: 0.003) I2: 0%) and 12 months (M.D: 1.78 [-1.52, 5.09], P: 0.29, I2: 0%) were higher in patients who received non-surgical than surgical therapy. However, pooled analysis for patients returning to work for both groups remained inconclusive. Conclusion: Altogether, we found no significant evidence supporting the clinical benefits of surgical over non-surgical therapy. Thus, the non-surgical approach remains the preferred therapeutic choice for managing shaft humeral fractures due to its lesser side effects.

Keywords: shaft humeral fracture, surgical treatment, Patient-related outcomes, return to work, DASH

Procedia PDF Downloads 71
11987 Gall Bladder Polyp Identified as Solitary RCC Metastasis 4 Years after Nephrectomy: An Unusual Case Report

Authors: Gerard Bray, Arya Bahadori, Sachinka Ranasinghe

Abstract:

Renal cell carcinoma (RCC) is among the top 10 most common cancers worldwide, where metastatic disease carries a poor prognosis. Herein, we present a 74-year-old male presenting with asymptomatic solitary metachronous metastasis to the gall bladder 4 years following nephrectomy for clear cell RCC. Solitary RCC metastasis to the gall bladder following nephrectomy is rarely reported in the literature and brings with it a clinical conundrum of whether surgical resection or systemic therapy should be utilized. In this case, surgical excision with cholecystectomy was employed without systemic therapy. We, therefore, contribute a rare and interesting case that highlights that metastasectomy of a solitary metastasis can improve survival according to current literature.

Keywords: renal cell carcinoma, gall bladder metastasis, solitary metastasectomy, metachronous

Procedia PDF Downloads 143
11986 Sunflower Irrigation with Two Different Types of Soil Moisture Sensors

Authors: C. D. Papanikolaou, V. A. Giouvanis, E. A. Karatasiou, D. S. Dimakas, M. A. Sakellariou-Makrantonaki

Abstract:

Irrigation is one of the most important cultivation practices for each crop, especially in areas where rainfall is enough to cover the crop water needs. In such areas, the farmers must irrigate in order to achieve high economical results. The precise irrigation scheduling contributes to irrigation water saving and thus a valuable natural resource is protected. Under this point of view, in the experimental field of the Laboratory of Agricultural Hydraulics of the University of Thessaly, a research was conducted during the growing season of 2012 in order to evaluate the growth, seed and oil production of sunflower as well as the water saving, by applying different methods of irrigation scheduling. Three treatments in four replications were organized. These were: a) surface drip irrigation where the irrigation scheduling based on the Penman-Monteith (PM) method (control); b) surface drip irrigation where the irrigation scheduling based on a soil moisture sensor (SMS); and c) surface drip irrigation, where the irrigation scheduling based on a soil potential sensor (WM).

Keywords: irrigation, energy production, soil moisture sensor, sunflower, water saving

Procedia PDF Downloads 153
11985 Formalizing a Procedure for Generating Uncertain Resource Availability Assumptions Based on Real Time Logistic Data Capturing with Auto-ID Systems for Reactive Scheduling

Authors: Lars Laußat, Manfred Helmus, Kamil Szczesny, Markus König

Abstract:

As one result of the project “Reactive Construction Project Scheduling using Real Time Construction Logistic Data and Simulation”, a procedure for using data about uncertain resource availability assumptions in reactive scheduling processes has been developed. Prediction data about resource availability is generated in a formalized way using real-time monitoring data e.g. from auto-ID systems on the construction site and in the supply chains. The paper focuses on the formalization of the procedure for monitoring construction logistic processes, for the detection of disturbance and for generating of new and uncertain scheduling assumptions for the reactive resource constrained simulation procedure that is and will be further described in other papers.

Keywords: auto-ID, construction logistic, fuzzy, monitoring, RFID, scheduling

Procedia PDF Downloads 483
11984 Multi-Objective Multi-Mode Resource-Constrained Project Scheduling Problem by Preemptive Fuzzy Goal Programming

Authors: Busaba Phurksaphanrat

Abstract:

This research proposes a pre-emptive fuzzy goal programming model for multi-objective multi-mode resource constrained project scheduling problem. The objectives of the problem are minimization of the total time and the total cost of the project. Objective in a multi-mode resource-constrained project scheduling problem is often a minimization of make-span. However, both time and cost should be considered at the same time with different level of important priorities. Moreover, all elements of cost functions in a project are not included in the conventional cost objective function. Incomplete total project cost causes an error in finding the project scheduling time. In this research, pre-emptive fuzzy goal programming is presented to solve the multi-objective multi-mode resource constrained project scheduling problem. It can find the compromise solution of the problem. Moreover, it is also flexible in adjusting to find a variety of alternative solutions.

Keywords: multi-mode resource constrained project scheduling problem, fuzzy set, goal programming, pre-emptive fuzzy goal programming

Procedia PDF Downloads 404
11983 Scheduling of Bus Fleet Departure Time Based on Mathematical Model of Number of Bus Stops for Municipality Bus Organization

Authors: Ali Abdi Kordani, Hamid Bigdelirad, Sid Mohammad Boroomandrad

Abstract:

Operating Urban Bus Transit System is a phenomenon that has a major role in transporting passengers in cities. There are many factors involved in planning and operating an Urban Bus Transit System, one of which is selecting optimized number of stops and scheduling of bus fleet departure. In this paper, we tried to introduce desirable methodology to select number of stops and schedule properly. Selecting the right number of stops causes convenience in accessibility and reduction in travel time and finally increase in public preference of this transportation mode. The achieved results revealed that number of stops must reduce from 33 to 25. Also according to scheduling and conducted economic analysis, the number of buses must decrease from 17 to 11 to have the most appropriate status for the Bus Organization.

Keywords: number of optimized stops, organizing bus system, scheduling, urban transit

Procedia PDF Downloads 86
11982 Single Machine Scheduling Problem to Minimize the Number of Tardy Jobs

Authors: Ali Allahverdi, Harun Aydilek, Asiye Aydilek

Abstract:

Minimizing the number of tardy jobs is an important factor to consider while making scheduling decisions. This is because on-time shipments are vital for lowering cost and increasing customers’ satisfaction. This paper addresses the single machine scheduling problem with the objective of minimizing the number of tardy jobs. The only known information is the lower and upper bounds for processing times, and deterministic job due dates. A dominance relation is established, and an algorithm is proposed. Several heuristics are generated from the proposed algorithm. Computational analysis indicates that the performance of one of the heuristics is very close to the optimal solution, i.e., on average, less than 1.5 % from the optimal solution.

Keywords: single machine scheduling, number of tardy jobs, heuristi, lower and upper bounds

Procedia PDF Downloads 534
11981 Centralized Peak Consumption Smoothing Revisited for Habitat Energy Scheduling

Authors: M. Benbouzid, Q. Bresson, A. Duclos, K. Longo, Q. Morel

Abstract:

Currently, electricity suppliers must predict the consumption of their customers in order to deduce the power they need to produce. It is, then, important in a first step to optimize household consumption to obtain more constant curves by limiting peaks in energy consumption. Here centralized real time scheduling is proposed to manage the equipment's starting in parallel. The aim is not to exceed a certain limit while optimizing the power consumption across a habitat. The Raspberry Pi is used as a box; this scheduler interacts with the various sensors in 6LoWPAN. At the scale of a single dwelling, household consumption decreases, particularly at times corresponding to the peaks. However, it would be wiser to consider the use of a residential complex so that the result would be more significant. So, the ceiling would no longer be fixed. The scheduling would be done on two scales, firstly, per dwelling, and secondly, at the level of a residential complex.

Keywords: smart grid, energy box, scheduling, Gang Model, energy consumption, energy management system, wireless sensor network

Procedia PDF Downloads 282
11980 The Breast Surgery Movement: A 50 Year Development of the Surgical Specialty

Authors: Lauren Zammerilla Westcott, Ronald C. Jones, James W. Fleshman

Abstract:

The surgical treatment of breast cancer has rapidly evolved over the past 50 years, progressing from Halsted’s radical mastectomy to a public campaign of surgical options, aesthetic reconstruction, and patient empowerment. This article examines the happenings that led to the transition of breast surgery as a subset of general surgery to its own specialized field. Sparked by the research of Dr. Bernard Fisher and the first National Surgical Adjuvant Breast and Bowel Project trial in 1971, the field of breast surgery underwent significant growth over the next several decades, enabling general surgeons to limit their practices to the breast. High surgical volumes eventually led to the development of the first formal breast surgical oncology fellowship in a large community-based hospital at Baylor University Medical Center in 1982. The establishment of the American Society of Breast Surgeons, as well several landmark clinical trials and public campaign efforts, further contributed to the advancement of breast surgery, making it the specialized field of the current era.

Keywords: breast cancer, breast fellowship, breast surgery, surgical history

Procedia PDF Downloads 105
11979 Simulation of Utility Accrual Scheduling and Recovery Algorithm in Multiprocessor Environment

Authors: A. Idawaty, O. Mohamed, A. Z. Zuriati

Abstract:

This paper presents the development of an event based Discrete Event Simulation (DES) for a recovery algorithm known Backward Recovery Global Preemptive Utility Accrual Scheduling (BR_GPUAS). This algorithm implements the Backward Recovery (BR) mechanism as a fault recovery solution under the existing Time/Utility Function/ Utility Accrual (TUF/UA) scheduling domain for multiprocessor environment. The BR mechanism attempts to take the faulty tasks back to its initial safe state and then proceeds to re-execute the affected section of the faulty tasks to enable recovery. Considering that faults may occur in the components of any system; a fault tolerance system that can nullify the erroneous effect is necessary to be developed. Current TUF/UA scheduling algorithm uses the abortion recovery mechanism and it simply aborts the erroneous task as their fault recovery solution. None of the existing algorithm in TUF/UA scheduling domain in multiprocessor scheduling environment have considered the transient fault and implement the BR mechanism as a fault recovery mechanism to nullify the erroneous effect and solve the recovery problem in this domain. The developed BR_GPUAS simulator has derived the set of parameter, events and performance metrics according to a detailed analysis of the base model. Simulation results revealed that BR_GPUAS algorithm can saved almost 20-30% of the accumulated utilities making it reliable and efficient for the real-time application in the multiprocessor scheduling environment.

Keywords: real-time system (RTS), time utility function/ utility accrual (TUF/UA) scheduling, backward recovery mechanism, multiprocessor, discrete event simulation (DES)

Procedia PDF Downloads 279
11978 Dynamic Self-Scheduling of Pumped-Storage Power Plant in Energy and Ancillary Service Markets Using Sliding Window Technique

Authors: P. Kanakasabapathy, S. Radhika

Abstract:

In the competitive electricity market environment, the profit of the pumped-storage plant in the energy market can be maximized by operating it as a generator, when market clearing price is high and as a pump, to pump water from lower reservoir to upper reservoir, when the price is low. An optimal self-scheduling plan has been developed for a pumped-storage plant, carried out on weekly basis in order to maximize the profit of the plant, keeping into account of all the major uncertainties such as the sudden ancillary service delivery request and the price forecasting errors. For a pumped storage power plant to operate in a real time market successive self-scheduling has to be done by considering the forecast of the day-ahead market and the modified reservoir storage due to the ancillary service request of the previous day. Sliding Window Technique has been used for successive self-scheduling to ensure profit for the plant.

Keywords: ancillary services, BPSO, power system economics, self-scheduling, sliding window technique

Procedia PDF Downloads 379
11977 The Development of Online-Class Scheduling Management System Conducted by the Case Study of Department of Social Science: Faculty of Humanities and Social Sciences Suan Sunandha Rajabhat University

Authors: Wipada Chaiwchan, Patcharee Klinhom

Abstract:

This research is aimed to develop the online-class scheduling management system and improve as a complex problem solution, this must take into consideration in various conditions and factors. In addition to the number of courses, the number of students and a timetable to study, the physical characteristics of each class room and regulations used in the class scheduling must also be taken into consideration. This system is developed to assist management in the class scheduling for convenience and efficiency. It can provide several instructors to schedule simultaneously. Both lecturers and students can check and publish a timetable and other documents associated with the system online immediately. It is developed in a web-based application. PHP is used as a developing tool. The database management system was MySQL. The tool that is used for efficiency testing of the system is questionnaire. The system was evaluated by using a Black-Box testing. The sample was composed of 2 groups: 5 experts and 100 general users. The average and the standard deviation of results from the experts were 3.50 and 0.67. The average and the standard deviation of results from the general users were 3.54 and 0.54. In summary, the results from the research indicated that the satisfaction of users was in a good level. Therefore, this system could be implemented in an actual workplace and satisfy the users’ requirement effectively

Keywords: timetable, schedule, management system, online

Procedia PDF Downloads 215
11976 Scheduling Method for Electric Heater in HEMS considering User’s Comfort

Authors: Yong-Sung Kim, Je-Seok Shin, Ho-Jun Jo, Jin-O Kim

Abstract:

Home Energy Management System (HEMS) which makes the residential consumers contribute to the demand response is attracting attention in recent years. An aim of HEMS is to minimize their electricity cost by controlling the use of their appliances according to electricity price. The use of appliances in HEMS may be affected by some conditions such as external temperature and electricity price. Therefore, the user’s usage pattern of appliances should be modeled according to the external conditions, and the resultant usage pattern is related to the user’s comfortability on use of each appliances. This paper proposes a methodology to model the usage pattern based on the historical data with the copula function. Through copula function, the usage range of each appliance can be obtained and is able to satisfy the appropriate user’s comfort according to the external conditions for next day. Within the usage range, an optimal scheduling for appliances would be conducted so as to minimize an electricity cost with considering user’s comfort. Among the home appliance, electric heater (EH) is a representative appliance which is affected by the external temperature. In this paper, an optimal scheduling algorithm for an electric heater (EH) is addressed based on the method of branch and bound. As a result, scenarios for the EH usage are obtained according to user’s comfort levels and then the residential consumer would select the best scenario. The case study shows the effects of the proposed algorithm compared with the traditional operation of the EH, and it also represents impacts of the comfort level on the scheduling result.

Keywords: load scheduling, usage pattern, user’s comfort, copula function, branch and bound, electric heater

Procedia PDF Downloads 555
11975 A Combined Meta-Heuristic with Hyper-Heuristic Approach to Single Machine Production Scheduling Problem

Authors: C. E. Nugraheni, L. Abednego

Abstract:

This paper is concerned with minimization of mean tardiness and flow time in a real single machine production scheduling problem. Two variants of genetic algorithm as meta-heuristic are combined with hyper-heuristic approach are proposed to solve this problem. These methods are used to solve instances generated with real world data from a company. Encouraging results are reported.

Keywords: hyper-heuristics, evolutionary algorithms, production scheduling, meta-heuristic

Procedia PDF Downloads 353
11974 ACO-TS: an ACO-based Algorithm for Optimizing Cloud Task Scheduling

Authors: Fahad Y. Al-dawish

Abstract:

The current trend by a large number of organizations and individuals to use cloud computing. Many consider it a significant shift in the field of computing. Cloud computing are distributed and parallel systems consisting of a collection of interconnected physical and virtual machines. With increasing request and profit of cloud computing infrastructure, diverse computing processes can be executed on cloud environment. Many organizations and individuals around the world depend on the cloud computing environments infrastructure to carry their applications, platform, and infrastructure. One of the major and essential issues in this environment related to allocating incoming tasks to suitable virtual machine (cloud task scheduling). Cloud task scheduling is classified as optimization problem, and there are several meta-heuristic algorithms have been anticipated to solve and optimize this problem. Good task scheduler should execute its scheduling technique on altering environment and the types of incoming task set. In this research project a cloud task scheduling methodology based on ant colony optimization ACO algorithm, we call it ACO-TS Ant Colony Optimization for Task Scheduling has been proposed and compared with different scheduling algorithms (Random, First Come First Serve FCFS, and Fastest Processor to the Largest Task First FPLTF). Ant Colony Optimization (ACO) is random optimization search method that will be used for assigning incoming tasks to available virtual machines VMs. The main role of proposed algorithm is to minimizing the makespan of certain tasks set and maximizing resource utilization by balance the load among virtual machines. The proposed scheduling algorithm was evaluated by using Cloudsim toolkit framework. Finally after analyzing and evaluating the performance of experimental results we find that the proposed algorithm ACO-TS perform better than Random, FCFS, and FPLTF algorithms in each of the makespaan and resource utilization.

Keywords: cloud Task scheduling, ant colony optimization (ACO), cloudsim, cloud computing

Procedia PDF Downloads 393
11973 Scheduling of Cross-Docking Center: An Auction-Based Algorithm

Authors: Eldho Paul, Brijesh Paul

Abstract:

This work proposes an auction mechanism based solution methodology for the optimum scheduling of trucks in a cross-docking centre. The cross-docking centre is an important element of lean supply chain. It reduces the amount of storage and transportation costs in the distribution system compared to an ordinary warehouse. Better scheduling of trucks in a cross-docking center is the best way to reduce storage and transportation costs. Auction mechanism is commonly used for allocation of limited resources in different real-life applications. Here, we try to schedule inbound trucks by integrating auction mechanism with the functioning of a cross-docking centre. A mathematical model is developed for the optimal scheduling of inbound trucks based on the auction methodology. The determination of exact solution for problems involving large number of trucks was found to be computationally difficult, and hence a genetic algorithm based heuristic methodology is proposed in this work. A comparative study of exact and heuristic solutions is done using five classes of data sets. It is observed from the study that the auction-based mechanism is capable of providing good solutions to scheduling problem in cross-docking centres.

Keywords: auction mechanism, cross-docking centre, genetic algorithm, scheduling of trucks

Procedia PDF Downloads 383
11972 The Effectiveness of Non-surgical Treatment for Androgenetic Alopecia in Men: A Systematic Review and Meta-Analysis

Authors: Monica Trifitriana, Rido Mulawarman

Abstract:

Introduction: Androgenetic alopecia (AGA) is a genetically predetermined disorder due to an excessive response to dihydrotestosterone (DHT). Currently, non-surgical treatment of androgenetic alopecia is more in demand by the patient. There are many non-surgical treatments, ranging from topical treatments oral medications, and procedure treatments. Objective: We aim to assess the latest evidence of the efficacy of non-surgical treatments of androgenetic alopecia in men in comparison to placebo for improving hair density, thickness, and growth. Method: We performed a comprehensive search on topics that assess non-surgical treatments of androgenetic alopecia in men from inception up until November 2021. Result: There were 24 studies out of a total of 2438 patients divided into five non-surgical treatment groups to assess the effectiveness of hair growth, namely: minoxidil 2% (MD: 8.11 hairs/cm²), minoxidil 5% (MD: 12.02 hairs/cm²), low-level laser light therapy/LLLT (MD: 12.35 hairs/cm²), finasteride 1mg (MD: 20.43 hairs/cm²), and Platelete-Rich Plasma/PRP with microneedling (MD: 26.33 hairs/cm²). All treatments had significant results for increasing hair growth, particularly in cases of androgenetic alopecia in men (P<0.00001). Conclusion: From the results, it was found that the five non-surgical treatment groups proved to be effective and significant for hair growth, particularly in cases of androgenetic alopecia in men. In order of the best non-surgical treatment for hair growth is starting from PRP with microneedling, Finasteride 1mg, LLLT, minoxidil 5%, to minoxidil 2%.

Keywords: androgenetic alopecia, non-surgical, men, meta-analysis, systematic review

Procedia PDF Downloads 130
11971 Tabu Search Algorithm for Ship Routing and Scheduling Problem with Time Window

Authors: Khaled Moh. Alhamad

Abstract:

This paper describes a tabu search heuristic for a ship routing and scheduling problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size.

Keywords: heuristic, scheduling, tabu search, transportation

Procedia PDF Downloads 478
11970 Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods

Authors: Halil Ibrahim Demir, Caner Erden, Mumtaz Ipek, Ozer Uygun

Abstract:

Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of these three important functions are not adequately addressed. Here, the integration of these three important functions is studied by using genetic, random-genetic hybrid, simulated annealing, random-simulated annealing hybrid and random search techniques. As well, the importance of the integration of these three functions and the power of meta-heuristics and of hybrid heuristics are studied.

Keywords: process planning, weighted scheduling, weighted due-date assignment, genetic search, simulated annealing, hybrid meta-heuristics

Procedia PDF Downloads 451
11969 Immersive Block Scheduling in Higher Education: A Case Study in Curriculum Reform and Increased Student Success

Authors: Thomas Roche, Erica Wilson, Elizabeth Goode

Abstract:

Universities across the globe are considering how to effect meaningful change in their higher education (HE) delivery in the face of increasingly diverse student cohorts and shifting student learning preferences. This paper reports on a descriptive case study of whole-of-institution curriculum reform at one regional Australian university, where more traditional 13-week semesters were replaced with a 6-week immersive block model drawing on active learning pedagogy. Based on a synthesis of literature in best practice HE pedagogy and principles, the case study draws on student performance data and senior management staff interviews (N = 5) to outline the key changes necessary for successful HE transformation to deliver increased student pass rates and retention. The findings from this case study indicate that an institutional transformation to an immersive block model requires both a considered change in institutional policy and process as well as the appropriate resourcing of roles, governance committees, technical solutions, and, importantly, communities of practice. Implications for practice at higher education institutions considering reforming their curriculum model are also discussed.

Keywords: student retention, immersive scheduling, block model, curriculum reform, active learning, higher education pedagogy, higher education policy

Procedia PDF Downloads 33
11968 Case Study on the Effects of Early Mobilization in the Post-Surgical Recovery of Athletes with Open Triangular Fibrocartilage Complex Repair

Authors: Blair Arthur Agero Jr., Lucia Garcia Heras

Abstract:

The triangular fibrocartilage complex (TFCC) is one of the crucial stabilizing ligaments of the wrist. The TFCC is also subject to excessive stress amongst performance athletes and enthusiasts. The excessive loading of the TFCC may lead to a partial or complete rupture that requires surgery. The recovery from an open TFCC surgical repair may take several months. Immobilization of the repaired wrist for a given period is part of all the current protocols in the post-surgical treatment. The immobilization to prevent the rotation of the forearm can last from six weeks to eight weeks with the wrist held in a neutral position. In all protocols reviewed, the pronosupination is only initiated between the 6th week and 8th week or even later after the cast is removed. The prolonged immobilization can cause stiffness of the wrist and hand. Furthermore, the entire period of post-surgical hand therapy has its economic impact, especially for performing athletes. However, delayed mobilization, specifically rotation of the wrist, is necessary to allow ligament healing. This study aims to report the effects of early mobilization of the wrist in athletes who had an open surgical repair of the TFCC. The surgery was done by the co-author, and the hand therapy was implemented by the main author. The cases documented spans from 2014 to 2019 and were all performed in Dubai, United Arab Emirates. All selected participants in this case study were provided with a follow-up questionnaire to ascertain their current condition since their surgery. The respondents reported high satisfaction in the results of their treatment and have verified zero re-rupture of their TFCC despite mobilizing and rotating the wrist at the third-week post-surgery during their hand therapy. There is also a negligible number of respondents who reported a limitation in their ranges of pronosupination. This case study suggests that early mobilization of the wrist after an open TFCC surgical repair can be more beneficial to the patient as opposed to the traditional treatment of prolonged immobilization. However, it should be considered that the patients selected in this case study are professional performance athletes and advanced fitness enthusiasts. Athletes are known to withstand vigorous physical stress in their training that may correlate to their ability to better cope with the progressive stress that was implemented during their hand therapy. Nevertheless, this approach has its merits, and application of it may be adjusted for patients with a similar injury and surgical procedure.

Keywords: hand therapy, performance athlete, TFCC repair, wrist ligament

Procedia PDF Downloads 121
11967 The Constraint of Machine Breakdown after a Match up Scheduling of Paper Manufacturing Industry

Authors: John M. Ikome

Abstract:

In the process of manufacturing, a machine breakdown usually forces a modified flow shop out of the prescribed state, this strategy reschedules part of the initial schedule to match up with the pre-schedule at some point with the objective to create a schedule that is reliable with the other production planning decisions like material flow, production and suppliers by utilizing a critical decision-making concept. We propose a rescheduling strategy and a match-up point that will have a determination procedure through an advanced feedback control mechanism to increase both the schedule quality and stability. These approaches are compared with alternative re-scheduling methods under different experimental settings.

Keywords: scheduling, heuristics, branch, integrated

Procedia PDF Downloads 389
11966 Drastic Improvement in Vision Following Surgical Excision of Juvenile Nasopharyngeal Angiofibroma with Compressive Optic Neuropathy

Authors: Sweta Das

Abstract:

This case report is a 15-year-old male who presented with painless unilateral vision loss from left optic nerve compression due to juvenile nasopharyngeal angiofibroma. JNA is a rare, benign neoplasm that causes intracranial and intraorbital bone destruction and extends aggressively into surrounding soft tissues. It accounts for <1% of all head and neck tumors, is predominantly found in pediatric males and tends to affect indigenous population disproportionately. The most common presenting symptom for JNA is epistaxis and nasal obstruction. However, it can invade orbit, chiasm and pituitary gland, causing loss of vision and field. Visual acuity and function near normalized following surgical excision. Optometry plays an important role in the diagnosis and co-management of JNA with optic nerve compression by closely monitoring afferent optic nerve function and structure, and extraocular motility. Visual function and acuity in patients with short-term compressive neuropathy may drastically improve following surgical resection as this case demonstrates.

Keywords: orbital mass, painless monocular vision loss, compressive optic neuropathy, pediatric tumor

Procedia PDF Downloads 33
11965 Automatic Queuing Model Applications

Authors: Fahad Suleiman

Abstract:

Queuing, in medical system is the process of moving patients in a specific sequence to a specific service according to the patients’ nature of illness. The term scheduling stands for the process of computing a schedule. This may be done by a queuing based scheduler. This paper focuses on the medical consultancy system, the different queuing algorithms that are used in healthcare system to serve the patients, and the average waiting time. The aim of this paper is to build automatic queuing system for organizing the medical queuing system that can analyses the queue status and take decision which patient to serve. The new queuing architecture model can switch between different scheduling algorithms according to the testing results and the factor of the average waiting time. The main innovation of this work concerns the modeling of the average waiting time is taken into processing, in addition with the process of switching to the scheduling algorithm that gives the best average waiting time.

Keywords: queuing systems, queuing system models, scheduling algorithms, patients

Procedia PDF Downloads 323
11964 A Hybrid Distributed Algorithm for Solving Job Shop Scheduling Problem

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a distributed hybrid algorithm is proposed for solving the job shop scheduling problem. The suggested method executes different artificial neural networks, heuristics and meta-heuristics simultaneously on more than one machine. The neural networks are used to control the constraints of the problem while the meta-heuristics search the global space and the heuristics are used to prevent the premature convergence. To attain an efficient distributed intelligent method for solving big and distributed job shop scheduling problems, Apache Spark and Hadoop frameworks are used. In the algorithm implementation and design steps, new approaches are applied. Comparison between the proposed algorithm and other efficient algorithms from the literature shows its efficiency, which is able to solve large size problems in short time.

Keywords: distributed algorithms, Apache Spark, Hadoop, job shop scheduling, neural network

Procedia PDF Downloads 355
11963 Overview of Time, Resource and Cost Planning Techniques in Construction Management Research

Authors: R. Gupta, P. Jain, S. Das

Abstract:

One way to approach construction scheduling optimization problem is to focus on the individual aspects of planning, which can be broadly classified as time scheduling, crew and resource management, and cost control. During the last four decades, construction planning has seen a lot of research, but to date, no paper had attempted to summarize the literature available under important heads. This paper addresses each of aspects separately, and presents the findings of an in-depth literature of the various planning techniques. For techniques dealing with time scheduling, the authors have adopted a rough chronological documentation. For crew and resource management, classification has been done on the basis of the different steps involved in the resource planning process. For cost control, techniques dealing with both estimation of costs and the subsequent optimization of costs have been dealt with separately.

Keywords: construction planning techniques, time scheduling, resource planning, cost control

Procedia PDF Downloads 454
11962 Integer Programming: Domain Transformation in Nurse Scheduling Problem.

Authors: Geetha Baskaran, Andrzej Barjiela, Rong Qu

Abstract:

Motivation: Nurse scheduling is a complex combinatorial optimization problem. It is also known as NP-hard. It needs an efficient re-scheduling to minimize some trade-off of the measures of violation by reducing selected constraints to soft constraints with measurements of their violations. Problem Statement: In this paper, we extend our novel approach to solve the nurse scheduling problem by transforming it through Information Granulation. Approach: This approach satisfies the rules of a typical hospital environment based on a standard benchmark problem. Generating good work schedules has a great influence on nurses' working conditions which are strongly related to the level of a quality health care. Domain transformation that combines the strengths of operation research and artificial intelligence was proposed for the solution of the problem. Compared to conventional methods, our approach involves judicious grouping (information granulation) of shifts types’ that transforms the original problem into a smaller solution domain. Later these schedules from the smaller problem domain are converted back into the original problem domain by taking into account the constraints that could not be represented in the smaller domain. An Integer Programming (IP) package is used to solve the transformed scheduling problem by expending the branch and bound algorithm. We have used the GNU Octave for Windows to solve this problem. Results: The scheduling problem has been solved in the proposed formalism resulting in a high quality schedule. Conclusion: Domain transformation represents departure from a conventional one-shift-at-a-time scheduling approach. It offers an advantage of efficient and easily understandable solutions as well as offering deterministic reproducibility of the results. We note, however, that it does not guarantee the global optimum.

Keywords: domain transformation, nurse scheduling, information granulation, artificial intelligence, simulation

Procedia PDF Downloads 370
11961 Radiographic Predictors of Mandibular Third Molar Extraction Difficulties under General Anaesthetic

Authors: Carolyn Whyte, Tina Halai, Sonita Koshal

Abstract:

Aim: There are many methods available to assess the potential difficulty of third molar surgery. This study investigated various factors to assess whether they had a bearing on the difficulties encountered. Study design: A retrospective study was completed of 62 single mandibular third molar teeth removed under day case general anaesthesia between May 2016 and August 2016 by 3 consultant oral surgeons. Method: Data collection was by examining the OPG radiographs of each tooth and recording the necessary data. This was depth of impaction, angulation, bony impaction, point of application in relation to second molar, root morphology, Pell and Gregory classification and Winters Lines. This was completed by one assessor and verified by another. Information on medical history, anxiety, ethnicity and age were recorded. Case notes and surgical entries were examined for any difficulties encountered. Results: There were 5 cases which encountered surgical difficulties which included fracture of root apices (3) which were left in situ, prolonged bleeding (1) and post-operative numbness >6 months(1). Four of the 5 cases had Pell and Gregory classification as (B) where the occlusal plane of the impacted tooth is between the occlusal plane and the cervical line of the adjacent tooth. 80% of cases had the point of application as either coronal or apical one third (1/3) in relation to the second molar. However, there was variability in all other aspects of assessment in predicting difficulty of removal. Conclusions: Of the cases which encountered difficulties they all had at least one predictor of potential complexity but these varied case by case.

Keywords: impaction, mandibular third molar, radiographic assessment, surgical removal

Procedia PDF Downloads 156
11960 Solving Process Planning, Weighted Earliest Due Date Scheduling and Weighted Due Date Assignment Using Simulated Annealing and Evolutionary Strategies

Authors: Halil Ibrahim Demir, Abdullah Hulusi Kokcam, Fuat Simsir, Özer Uygun

Abstract:

Traditionally, three important manufacturing functions which are process planning, scheduling and due-date assignment are performed sequentially and separately. Although there are numerous works on the integration of process planning and scheduling and plenty of works focusing on scheduling with due date assignment, there are only a few works on integrated process planning, scheduling and due-date assignment. Although due-dates are determined without taking into account of weights of the customers in the literature, here weighted due-date assignment is employed to get better performance. Jobs are scheduled according to weighted earliest due date dispatching rule and due dates are determined according to some popular due date assignment methods by taking into account of the weights of each job. Simulated Annealing, Evolutionary Strategies, Random Search, hybrid of Random Search and Simulated Annealing, and hybrid of Random Search and Evolutionary Strategies, are applied as solution techniques. Three important manufacturing functions are integrated step-by-step and higher integration levels are found better. Search meta-heuristics are found to be very useful while improving performance measure.

Keywords: process planning, weighted scheduling, weighted due-date assignment, simulated annealing, evolutionary strategies, hybrid searches

Procedia PDF Downloads 432