Search results for: chemotherapy scheduling
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 683

Search results for: chemotherapy scheduling

593 Two Stage Assembly Flowshop Scheduling Problem Minimizing Total Tardiness

Authors: Ali Allahverdi, Harun Aydilek, Asiye Aydilek

Abstract:

The two stage assembly flowshop scheduling problem has lots of application in real life. To the best of our knowledge, the two stage assembly flowshop scheduling problem with total tardiness performance measure and separate setup times has not been addressed so far, and hence, it is addressed in this paper. Different dominance relations are developed and several algorithms are proposed. Extensive computational experiments are conducted to evaluate the proposed algorithms. The computational experiments have shown that one of the algorithms performs much better than the others. Moreover, the experiments have shown that the best performing algorithm performs much better than the best existing algorithm for the case of zero setup times in the literature. Therefore, the proposed best performing algorithm not only can be used for problems with separate setup times but also for the case of zero setup times.

Keywords: scheduling, assembly flowshop, total tardiness, algorithm

Procedia PDF Downloads 316
592 A Novel Integration of Berth Allocation, Quay Cranes and Trucks Scheduling Problems in Container Terminals

Authors: M. Moharami Gargari, S. Javdani Zamani, A. Mohammadnejad, S. Abuali

Abstract:

As maritime container transport is developing fast, the need arises for efficient operations at container terminals. One of the most important determinants of container handling efficiency is the productivity of quay cranes and internal transportation vehicles, which are responsible transporting of containers for unloading and loading operations for container vessels. For this reason, this paper presents an integrated mathematical model formulation for discrete berths with quay cranes and internal transportations vehicles. The problems have received increasing attention in the literature and the present paper deals with the integration of these interrelated problems. A new mixed integer linear formulation is developed for the Berth Allocation Problem (BAP), Quay Crane Assignment and Scheduling Problem (QCASP) and Internal Transportation Scheduling (ITS), which accounts for cranes and trucks positioning conditions.

Keywords: discrete berths, container terminal, truck scheduling, dynamic vessel arrival

Procedia PDF Downloads 368
591 A Bi-Objective Model to Address Simultaneous Formulation of Project Scheduling and Material Ordering

Authors: Babak H. Tabrizi, Seyed Farid Ghaderi

Abstract:

Concurrent planning of project scheduling and material ordering has been increasingly addressed within last decades as an approach to improve the project execution costs. Therefore, we have taken the problem into consideration in this paper, aiming to maximize schedules quality robustness, in addition to minimize the relevant costs. In this regard, a bi-objective mathematical model is developed to formulate the problem. Moreover, it is possible to utilize the all-unit discount for materials purchasing. The problem is then solved by the constraint method, and the Pareto front is obtained for a variety of robustness values. The applicability and efficiency of the proposed model is tested by different numerical instances, finally.

Keywords: e-constraint method, material ordering, project management, project scheduling

Procedia PDF Downloads 261
590 Functionalized SPIO Conjugated with Doxorubicin for Tumor Diagnosis and Chemotherapy Enhanced by Applying Magnetic Fields

Authors: Po-Chin Liang, Yung-Chu Chen, Chi-Feng Chiang, Yun-Ping Lin, Wen-Yuan Hsieh, Win-Li Lin

Abstract:

The aim of this study was to develop super paramagnetic iron oxide (SPIO) nano-particles comprised of a magnetic Fe3O4 core and a shell of aqueous stable self-doped polyethylene glycol (PEG) with a high loading of doxorubicin (SPIO-PEG-D) for tumor theranostics. The in-vivo MRI study showed that there was a stronger T2-weighted signal enhancement for the group under a magnetic field, and hence it indicated that this group had a better accumulation of SPIO-PEG than the group without a magnetic field. In the anticancer evaluation of SPIO-PEG-D, the group with a magnetic field displayed a significantly smaller tumor size than the group without. The overall results show that SPIO-PEG-D nanoparticles have the potential for the application of MRI/monitoring chemotherapy and the therapy can be locally enhanced by applying an external magnetic field.

Keywords: super paramagnetic iron oxide nano particles, doxorubicin, chemotherapy, MRI, magnetic fields

Procedia PDF Downloads 576
589 Job Shop Scheduling: Classification, Constraints and Objective Functions

Authors: Majid Abdolrazzagh-Nezhad, Salwani Abdullah

Abstract:

The job-shop scheduling problem (JSSP) is an important decision facing those involved in the fields of industry, economics and management. This problem is a class of combinational optimization problem known as the NP-hard problem. JSSPs deal with a set of machines and a set of jobs with various predetermined routes through the machines, where the objective is to assemble a schedule of jobs that minimizes certain criteria such as makespan, maximum lateness, and total weighted tardiness. Over the past several decades, interest in meta-heuristic approaches to address JSSPs has increased due to the ability of these approaches to generate solutions which are better than those generated from heuristics alone. This article provides the classification, constraints and objective functions imposed on JSSPs that are available in the literature.

Keywords: job-shop scheduling, classification, constraints, objective functions

Procedia PDF Downloads 411
588 A Self-Directed Home Yoga Program for Women with Breast Cancer during Chemotherapy

Authors: Hiroko Komatsu, Kaori Yagasaki

Abstract:

Background: Cancer-related cognitive impairment is a common problem seen in cancer patients undergoing chemotherapy. Physical activity may show beneficial effects on the cognitive function in such patients. Therefore, we have developed a self-directed home yoga program for cancer patients with cognitive symptoms during chemotherapy. This program involves a DVD presenting a combination of yoga courses based on patient preferences to be practiced at home. This study was performed to examine the feasibility of this program. In addition, we also examined changes in cognitive function and quality of life (QOL) in these patients participating in the program. Methods: This prospective feasibility study was conducted in a 500-bed general hospital in Tokyo, Japan. The study population consisted of breast cancer patients undergoing chemotherapy as the initial therapy. This feasibility study used a convenience sample with estimation of recruitment rate in a single facility with the availability of trained nurses and physicians to ensure safe yoga intervention. The aim of the intervention program was to improve cognitive function by means of both physical and mental activation via yoga, consisting of physical practice, breathing exercises, and meditation. Information on the yoga program was provided as a booklet, with an instructor-guided group yoga class during the orientation, and a self-directed home yoga program on DVD with yoga logs. Results: The recruitment rate was 44.7%, and the study population consisted of 18 women with a mean age of 43.9 years. This study showed high rates of retention, adherence, and acceptability of the yoga program. Improvements were only observed in the cognitive aspects of fatigue, and there were serious adverse events during the program. Conclusion: The self-directed home yoga program discussed here was both feasible and safe for breast cancer patients showing cognitive symptoms during chemotherapy. The patients also rated the program as useful, interesting, and satisfactory. Participation in the program was associated with improvements in cognitive fatigue but not cognitive function.

Keywords: yoga, cognition, breast cancer, chemotherapy, quality of life

Procedia PDF Downloads 237
587 Wait-Optimized Scheduler Algorithm for Efficient Process Scheduling in Computer Systems

Authors: Md Habibur Rahman, Jaeho Kim

Abstract:

Efficient process scheduling is a crucial factor in ensuring optimal system performance and resource utilization in computer systems. While various algorithms have been proposed over the years, there are still limitations to their effectiveness. This paper introduces a new Wait-Optimized Scheduler (WOS) algorithm that aims to minimize process waiting time by dividing them into two layers and considering both process time and waiting time. The WOS algorithm is non-preemptive and prioritizes processes with the shortest WOS. In the first layer, each process runs for a predetermined duration, and any unfinished process is subsequently moved to the second layer, resulting in a decrease in response time. Whenever the first layer is free or the number of processes in the second layer is twice that of the first layer, the algorithm sorts all the processes in the second layer based on their remaining time minus waiting time and sends one process to the first layer to run. This ensures that all processes eventually run, optimizing waiting time. To evaluate the performance of the WOS algorithm, we conducted experiments comparing its performance with traditional scheduling algorithms such as First-Come-First-Serve (FCFS) and Shortest-Job-First (SJF). The results showed that the WOS algorithm outperformed the traditional algorithms in reducing the waiting time of processes, particularly in scenarios with a large number of short tasks with long wait times. Our study highlights the effectiveness of the WOS algorithm in improving process scheduling efficiency in computer systems. By reducing process waiting time, the WOS algorithm can improve system performance and resource utilization. The findings of this study provide valuable insights for researchers and practitioners in developing and implementing efficient process scheduling algorithms.

Keywords: process scheduling, wait-optimized scheduler, response time, non-preemptive, waiting time, traditional scheduling algorithms, first-come-first-serve, shortest-job-first, system performance, resource utilization

Procedia PDF Downloads 63
586 Solving Operating Room Scheduling Problem by Using Dispatching Rule

Authors: Yang-Kuei Lin, Yin-Yi Chou

Abstract:

In this research, we have considered operating room scheduling problem. The objective is to minimize total operating cost. The total operating cost includes idle cost and overtime cost. We have proposed a dispatching rule that can guarantee to find feasible solutions for the studied problem efficiently. We compared the proposed dispatching rule with the optimal solutions found by solving Inter Programming, and other solutions found by using modified existing dispatching rules. The computational results indicates that the proposed heuristic can find near optimal solutions efficiently.

Keywords: assignment, dispatching rule, operation rooms, scheduling

Procedia PDF Downloads 207
585 Efficacy and Safety of Inhaled Nebulized Chemotherapy in Treatment of Patients with Newly Diagnosed Pulmonary Tuberculosis in Comparison to Standard Antimycobacterial Therapy

Authors: M. Kuzhko, M. Gumeniuk, D. Butov, T. Tlustova, O. Denysov, T. Sprynsian

Abstract:

Abstract: The objective of this work was to study the efficacy and safety of inhaled nebulized chemotherapy in the treatment of patients with newly diagnosed pulmonary tuberculosis in comparison with standard antimycobacterial therapy. Materials and methods: The study involved 68 patients aged between 20 and 70 years with newly diagnosed pulmonary tuberculosis. Patients were allocated to two groups. The first (main, n=21) group of patients received standard chemotherapy and further 0.15 g of isoniazid and rifampicin 0.15 g inhaled through a nebulizer, also they received salmeterol 50 mcg + fluticasone propionate 250 mcg at 2 breaths twice a day for 2 months. The second (control, n=47) group of patients received standard chemotherapy, consisting of orally administered isoniazid (0.3 g), rifampicin (0.6 g), pyrazinamide (2 g), ethambutol (1.2 g) with a dose reduction after the intensive phase of the therapy. The anti-TB drugs were procured through the Ukraine’s centralized national supply system. Results: Intoxication symptoms in the first group reduced following 1.39±0.18 months, whereas in the second group, intoxication symptoms reduced following 2.7±0.1 months, p<.001. Moreover, respiratory symptoms regression in the first group was observed following 1.6±0.2 months, whereas in the second group – following 2.5±0.2 months, p<0.05. Bacillary excretion period evaluated within 1 month was reduced, as it was shown by 66.6±10.5% in the main group compared to 27.6±6.5%, p<0.05, in the control group. In addition, period of cavities healing was reduced to 2.9±0.2 months in the main group compared to 3.7±0.1 months, p<0.05, in the control group. Residual radiological lung damage findings (large residual changes) were observed in 22 (23.8±9.5 %) patients of the main group versus 24 (51.0±7.2 %) patients in the control group, p<0.05. After completion of treatment scar stenosis of the bronchi II-III art. diagnosed in 3 (14.2±7.8%) patients in main group and 17 (68.0±6.8%) - control group, p<0.05. The duration of hospital treatment was 2.4±0.4 months in main group and 4.1±0.4 months in control group, p<0.05. Conclusion: Administration of of inhaled nebulized chemotherapy in patients with newly diagnosed pulmonary tuberculosis resulted in a comparatively quick reduction of disease manifestation.

Keywords: inhaled nebulized chemotherapy, pulmonary tuberculosis, tuberculosis, treatment of tuberculosis

Procedia PDF Downloads 167
584 Effect of Low Level Laser Therapy versus Polarized Light Therapy on Oral Mucositis in Cancer Patients Receiving Chemotherapy

Authors: Andrew Anis Fakhrey Mosaad

Abstract:

The goal of this study is to compare the efficacy of polarised light therapy with low-intensity laser therapy in treating oral mucositis brought on by chemotherapy in cancer patients. Evaluation procedures are the measurement of the WHO oral mucositis scale and the Common toxicity criteria scale. Techniques: Cancer patients (men and women) who had oral mucositis, ulceration, and discomfort and whose ages varied from 30 to 55 years were separated into two groups and received 40 chemotherapy treatments. Twenty patients in Group (A) received low-level laser therapy (LLLT) along with their regular oral mucositis medication treatment, while twenty patients in Group (B) received Bioptron light therapy (BLT) along with their regular oral mucositis medication treatment. Both treatments were applied for 10 minutes each day for 30 days. Conclusion and results: This study showed that the use of both BLT and LLLT on oral mucositis in cancer patients following chemotherapy greatly improved, as seen by the sharp falls in both the WHO oral mucositis scale (OMS) and the common toxicity criteria scale (CTCS). However, low-intensity laser therapy (LLLT) was superior to Bioptron light therapy in terms of benefits (BLT).

Keywords: Bioptron light therapy, low level laser therapy, oral mucositis, WHO oral mucositis scale, common toxicity criteria scale

Procedia PDF Downloads 205
583 Integrating Process Planning, WMS Dispatching, and WPPW Weighted Due Date Assignment Using a Genetic Algorithm

Authors: Halil Ibrahim Demir, Tarık Cakar, Ibrahim Cil, Muharrem Dugenci, Caner Erden

Abstract:

Conventionally, process planning, scheduling, and due-date assignment functions are performed separately and sequentially. The interdependence of these functions requires integration. Although integrated process planning and scheduling, and scheduling with due date assignment problems are popular research topics, only a few works address the integration of these three functions. This work focuses on the integration of process planning, WMS scheduling, and WPPW due date assignment. Another novelty of this work is the use of a weighted due date assignment. In the literature, due dates are generally assigned without considering the importance of customers. However, in this study, more important customers get closer due dates. Typically, only tardiness is punished, but the JIT philosophy punishes both earliness and tardiness. In this study, all weighted earliness, tardiness, and due date related costs are penalized. As no customer desires distant due dates, such distant due dates should be penalized. In this study, various levels of integration of these three functions are tested and genetic search and random search are compared both with each other and with ordinary solutions. Higher integration levels are superior, while search is always useful. Genetic searches outperformed random searches.

Keywords: process planning, weighted scheduling, weighted due-date assignment, genetic algorithm, random search

Procedia PDF Downloads 352
582 Distributed Cost-Based Scheduling in Cloud Computing Environment

Authors: Rupali, Anil Kumar Jaiswal

Abstract:

Cloud computing can be defined as one of the prominent technologies that lets a user change, configure and access the services online. it can be said that this is a prototype of computing that helps in saving cost and time of a user practically the use of cloud computing can be found in various fields like education, health, banking etc.  Cloud computing is an internet dependent technology thus it is the major responsibility of Cloud Service Providers(CSPs) to care of data stored by user at data centers. Scheduling in cloud computing environment plays a vital role as to achieve maximum utilization and user satisfaction cloud providers need to schedule resources effectively.  Job scheduling for cloud computing is analyzed in the following work. To complete, recreate the task calculation, and conveyed scheduling methods CloudSim3.0.3 is utilized. This research work discusses the job scheduling for circulated processing condition also by exploring on this issue we find it works with minimum time and less cost. In this work two load balancing techniques have been employed: ‘Throttled stack adjustment policy’ and ‘Active VM load balancing policy’ with two brokerage services ‘Advanced Response Time’ and ‘Reconfigure Dynamically’ to evaluate the VM_Cost, DC_Cost, Response Time, and Data Processing Time. The proposed techniques are compared with Round Robin scheduling policy.

Keywords: physical machines, virtual machines, support for repetition, self-healing, highly scalable programming model

Procedia PDF Downloads 135
581 Benders Decomposition Approach to Solve the Hybrid Flow Shop Scheduling Problem

Authors: Ebrahim Asadi-Gangraj

Abstract:

Hybrid flow shop scheduling problem (HFS) contains sequencing in a flow shop where, at any stage, there exist one or more related or unrelated parallel machines. This production system is a common manufacturing environment in many real industries, such as the steel manufacturing, ceramic tile manufacturing, and car assembly industries. In this research, a mixed integer linear programming (MILP) model is presented for the hybrid flow shop scheduling problem, in which, the objective consists of minimizing the maximum completion time (makespan). For this purpose, a Benders Decomposition (BD) method is developed to solve the research problem. The proposed approach is tested on some test problems, small to moderate scale. The experimental results show that the Benders decomposition approach can solve the hybrid flow shop scheduling problem in a reasonable time, especially for small and moderate-size test problems.

Keywords: hybrid flow shop, mixed integer linear programming, Benders decomposition, makespan

Procedia PDF Downloads 148
580 Hierarchical Queue-Based Task Scheduling with CloudSim

Authors: Wanqing You, Kai Qian, Ying Qian

Abstract:

The concepts of Cloud Computing provide users with infrastructure, platform and software as service, which make those services more accessible for people via Internet. To better analysis the performance of Cloud Computing provisioning policies as well as resources allocation strategies, a toolkit named CloudSim proposed. With CloudSim, the Cloud Computing environment can be easily constructed by modelling and simulating cloud computing components, such as datacenter, host, and virtual machine. A good scheduling strategy is the key to achieve the load balancing among different machines as well as to improve the utilization of basic resources. Recently, the existing scheduling algorithms may work well in some presumptive cases in a single machine; however they are unable to make the best decision for the unforeseen future. In real world scenario, there would be numbers of tasks as well as several virtual machines working in parallel. Based on the concepts of multi-queue, this paper presents a new scheduling algorithm to schedule tasks with CloudSim by taking into account several parameters, the machines’ capacity, the priority of tasks and the history log.

Keywords: hierarchical queue, load balancing, CloudSim, information technology

Procedia PDF Downloads 393
579 Task Scheduling on Parallel System Using Genetic Algorithm

Authors: Jasbir Singh Gill, Baljit Singh

Abstract:

Scheduling and mapping the application task graph on multiprocessor parallel systems is considered as the most crucial and critical NP-complete problem. Many genetic algorithms have been proposed to solve such problems. In this paper, two genetic approach based algorithms have been designed and developed with or without task duplication. The proposed algorithms work on two fitness functions. The first fitness i.e. task fitness is used to minimize the total finish time of the schedule (schedule length) while the second fitness function i.e. process fitness is concerned with allocating the tasks to the available highly efficient processor from the list of available processors (load balance). Proposed genetic-based algorithms have been experimentally implemented and evaluated with other state-of-art popular and widely used algorithms.

Keywords: parallel computing, task scheduling, task duplication, genetic algorithm

Procedia PDF Downloads 310
578 Resource Allocation and Task Scheduling with Skill Level and Time Bound Constraints

Authors: Salam Saudagar, Ankit Kamboj, Niraj Mohan, Satgounda Patil, Nilesh Powar

Abstract:

Task Assignment and Scheduling is a challenging Operations Research problem when there is a limited number of resources and comparatively higher number of tasks. The Cost Management team at Cummins needs to assign tasks based on a deadline and must prioritize some of the tasks as per business requirements. Moreover, there is a constraint on the resources that assignment of tasks should be done based on an individual skill level, that may vary for different tasks. Another constraint is for scheduling the tasks that should be evenly distributed in terms of number of working hours, which adds further complexity to this problem. The proposed greedy approach to solve assignment and scheduling problem first assigns the task based on management priority and then by the closest deadline. This is followed by an iterative selection of an available resource with the least allocated total working hours for a task, i.e. finding the local optimal choice for each task with the goal of determining the global optimum. The greedy approach task allocation is compared with a variant of Hungarian Algorithm, and it is observed that the proposed approach gives an equal allocation of working hours among the resources. The comparative study of the proposed approach is also done with manual task allocation and it is noted that the visibility of the task timeline has increased from 2 months to 6 months. An interactive dashboard app is created for the greedy assignment and scheduling approach and the tasks with more than 2 months horizon that were waiting in a queue without a delivery date initially are now analyzed effectively by the business with expected timelines for completion.

Keywords: assignment, deadline, greedy approach, Hungarian algorithm, operations research, scheduling

Procedia PDF Downloads 116
577 Using the SMT Solver to Minimize the Latency and to Optimize the Number of Cores in an NoC-DSP Architectures

Authors: Imen Amari, Kaouther Gasmi, Asma Rebaya, Salem Hasnaoui

Abstract:

The problem of scheduling and mapping data flow applications on multi-core architectures is notoriously difficult. This difficulty is related to the rapid evaluation of Telecommunication and multimedia systems accompanied by a rapid increase of user requirements in terms of latency, execution time, consumption, energy, etc. Having an optimal scheduling on multi-cores DSP (Digital signal Processors) platforms is a challenging task. In this context, we present a novel technic and algorithm in order to find a valid schedule that optimizes the key performance metrics particularly the Latency. Our contribution is based on Satisfiability Modulo Theories (SMT) solving technologies which is strongly driven by the industrial applications and needs. This paper, describe a scheduling module integrated in our proposed Workflow which is advised to be a successful approach for programming the applications based on NoC-DSP platforms. This workflow transform automatically a Simulink model to a synchronous dataflow (SDF) model. The automatic transformation followed by SMT solver scheduling aim to minimize the final latency and other software/hardware metrics in terms of an optimal schedule. Also, finding the optimal numbers of cores to be used. In fact, our proposed workflow taking as entry point a Simulink file (.mdl or .slx) derived from embedded Matlab functions. We use an approach which is based on the synchronous and hierarchical behavior of both Simulink and SDF. Whence, results of running the scheduler which exist in the Workflow mentioned above using our proposed SMT solver algorithm refinements produce the best possible scheduling in terms of latency and numbers of cores.

Keywords: multi-cores DSP, scheduling, SMT solver, workflow

Procedia PDF Downloads 254
576 Oxidative Antioxidative Status and DNA Damage Profile Induced by Chemotherapy in Algerian Children with Lymphoma

Authors: Assia Galleze, Abdurrahim Kocyigit, Nacira Cherif, Nidel Benhalilou, Nabila Attal, Chafia Touil Boukkoffa, Rachida Raache

Abstract:

Introduction and aims: Chemotherapeutic agents used to inhibit cell division and reduce tumor growth, increase reactive oxygen species levels, which contributes to their genotoxicity [1]. The comet assay is an inexpensive and rapid method to detect the damage at cellular levels and has been used in various cancer populations undergoing chemotherapy [2,3]. The present study aim to assess the oxidative stress and the genotoxicity induced by chemotherapy by the determination of plasma malondialdehyde (MDA) level, protein carbonyl (PC) content, superoxide dismutase (SOD) activity and lymphocyte DNA damage in Algerian children with lymphoma. Materials and Methods: For our study, we selected thirty children with lymphoma treated in university hospital of Beni Messous, Algeria, and fifty unrelated subjects as controls, after obtaining the informed consent in accordance with the Declaration of Helsinki (1964). Plasma levels of MDA, PC and SOD activity were spectrophotometrically measured, while DNA damage was assessed by alkaline comet assay in peripheral blood leukocytes. Results and Discussion: Plasma MDA, PC levels and lymphocyte DNA damage, were found to be significantly higher in lymphoma patients than in controls (p < 0.001). Whereas, SOD activity in lymphoma patients was significantly lower than in healthy controls (p < 0.001). There were significant positive correlations between DNA damage, MDA and PC in patients (r = 0.96, p < 0.001, r = 0.97, p < 0.001, respectively), and negative correlation with SOD (r = 0.87, p < 0.01). Conclusion and Perspective: Our results indicated that, leukocytes DNA damage and oxidative stress were significantly higher in lymphoma patients, suggesting that the direct effect of chemotherapy and the alteration of the redox balance may influence oxidative/antioxidative status.

Keywords: chemotherapy, comet assay, DNA damage, lymphoma

Procedia PDF Downloads 99
575 A Construction Scheduling Model by Applying Pedestrian and Vehicle Simulation

Authors: Akhmad F. K. Khitam, Yi Tai, Hsin-Yun Lee

Abstract:

In the modern research of construction management, the goals of scheduling are not only to finish the project within the limited duration, but also to improve the impact of people and environment. Especially for the impact to the pedestrian and vehicles, the considerable social cost should be estimated in the total performance of a construction project. However, the site environment has many differences between projects. These interactions affect the requirement and goal of scheduling. It is difficult for schedule planners to quantify these interactions. Therefore, this study use 3D dynamic simulation technology to plan the schedule of the construction engineering projects that affect the current space users (i.e., the pedestrians and vehicles). The proposed model can help the project manager find out the optimal schedule to minimize the inconvenience brought to the space users. Besides, a roadwork project and a building renovation project were analyzed for the practical situation of engineering and operations. Then this study integrates the proper optimization algorithms and computer technology to establish a decision support model. The proposed model can generate a near-optimal schedule solution for project planners.

Keywords: scheduling, simulation, optimization, pedestrian and vehicle behavior

Procedia PDF Downloads 106
574 An Efficient Subcarrier Scheduling Algorithm for Downlink OFDMA-Based Wireless Broadband Networks

Authors: Hassen Hamouda, Mohamed Ouwais Kabaou, Med Salim Bouhlel

Abstract:

The growth of wireless technology made opportunistic scheduling a widespread theme in recent research. Providing high system throughput without reducing fairness allocation is becoming a very challenging task. A suitable policy for resource allocation among users is of crucial importance. This study focuses on scheduling multiple streaming flows on the downlink of a WiMAX system based on orthogonal frequency division multiple access (OFDMA). In this paper, we take the first step in formulating and analyzing this problem scrupulously. As a result, we proposed a new scheduling scheme based on Round Robin (RR) Algorithm. Because of its non-opportunistic process, RR does not take in account radio conditions and consequently it affect both system throughput and multi-users diversity. Our contribution called MORRA (Modified Round Robin Opportunistic Algorithm) consists to propose a solution to this issue. MORRA not only exploits the concept of opportunistic scheduler but also takes into account other parameters in the allocation process. The first parameter is called courtesy coefficient (CC) and the second is called Buffer Occupancy (BO). Performance evaluation shows that this well-balanced scheme outperforms both RR and MaxSNR schedulers and demonstrate that choosing between system throughput and fairness is not required.

Keywords: OFDMA, opportunistic scheduling, fairness hierarchy, courtesy coefficient, buffer occupancy

Procedia PDF Downloads 264
573 A Hybrid Model of Goal, Integer and Constraint Programming for Single Machine Scheduling Problem with Sequence Dependent Setup Times: A Case Study in Aerospace Industry

Authors: Didem Can

Abstract:

Scheduling problems are one of the most fundamental issues of production systems. Many different approaches and models have been developed according to the production processes of the parts and the main purpose of the problem. In this study, one of the bottleneck stations of a company serving in the aerospace industry is analyzed and considered as a single machine scheduling problem with sequence-dependent setup times. The objective of the problem is assigning a large number of similar parts to the same shift -to reduce chemical waste- while minimizing the number of tardy jobs. The goal programming method will be used to achieve two different objectives simultaneously. The assignment of parts to the shift will be expressed using the integer programming method. Finally, the constraint programming method will be used as it provides a way to find a result in a short time by avoiding worse resulting feasible solutions with the defined variables set. The model to be established will be tested and evaluated with real data in the application part.

Keywords: constraint programming, goal programming, integer programming, sequence-dependent setup, single machine scheduling

Procedia PDF Downloads 195
572 Symphony of Healing: Exploring Music and Art Therapy’s Impact on Chemotherapy Patients with Cancer

Authors: Sunidhi Sood, Drashti Narendrakumar Shah, Aakarsh Sharma, Nirali Harsh Panchal, Maria Karizhenskaia

Abstract:

Cancer is a global health concern, causing a significant number of deaths, with chemotherapy being a standard treatment method. However, chemotherapy often induces side effects that profoundly impact the physical and emotional well-being of patients, lowering their overall quality of life (QoL). This research aims to investigate the potential of music and art therapy as holistic adjunctive therapy for cancer patients undergoing chemotherapy, offering non-pharmacological support. This is achieved through a comprehensive review of existing literature with a focus on the following themes, including stress and anxiety alleviation, emotional expression and coping skill development, transformative changes, and pain management with mood upliftment. A systematic search was conducted using Medline, Google Scholar, and St. Lawrence College Library, considering original, peer-reviewed research papers published from 2014 to 2023. The review solely incorporated studies focusing on the impact of music and art therapy on the health and overall well-being of cancer patients undergoing chemotherapy in North America. The findings from 16 studies involving pediatric oncology patients, females affected by breast cancer, and general oncology patients show that music and art therapies significantly reduce anxiety (standardized mean difference: -1.10) and improve perceived stress (median change: -4.0) and overall quality of life in cancer patients undergoing chemotherapy. Furthermore, music therapy has demonstrated the potential to decrease anxiety, depression, and pain during infusion treatments (average changes in resilience scale: 3.4 and 4.83 for instrumental and vocal music therapy, respectively). This data calls for consideration of the integration of music and art therapy into supportive care programs for cancer patients undergoing chemotherapy. Moreover, it provides guidance to healthcare professionals and policymakers, facilitating the development of patient-centered strategies for cancer care in Canada. Further research is needed in collaboration with qualified therapists to examine its applicability and explore and evaluate patients' perceptions and expectations in order to optimize the therapeutic benefits and overall patient experience. In conclusion, integrating music and art therapy in cancer care promises to substantially enhance the well-being and psychosocial state of patients undergoing chemotherapy. However, due to the small population size considered in existing studies, further research is needed to bridge the knowledge gap and ensure a comprehensive, patient-centered approach, ultimately enhancing the quality of life (QoL) for individuals facing the challenges of cancer treatment.

Keywords: anxiety, cancer, chemotherapy, depression, music and art therapy, pain management, quality of life

Procedia PDF Downloads 29
571 A Fuzzy Mathematical Model for Order Acceptance and Scheduling Problem

Authors: E. Koyuncu

Abstract:

The problem of Order Acceptance and Scheduling (OAS) is defined as a joint decision of which orders to accept for processing and how to schedule them. Any linear programming model representing real-world situation involves the parameters defined by the decision maker in an uncertain way or by means of language statement. Fuzzy data can be used to incorporate vagueness in the real-life situation. In this study, a fuzzy mathematical model is proposed for a single machine OAS problem, where the orders are defined by their fuzzy due dates, fuzzy processing times, and fuzzy sequence dependent setup times. The signed distance method, one of the fuzzy ranking methods, is used to handle the fuzzy constraints in the model.

Keywords: fuzzy mathematical programming, fuzzy ranking, order acceptance, single machine scheduling

Procedia PDF Downloads 307
570 Solving Flowshop Scheduling Problems with Ant Colony Optimization Heuristic

Authors: Arshad Mehmood Ch, Riaz Ahmad, Imran Ali Ch, Waqas Durrani

Abstract:

This study deals with the application of Ant Colony Optimization (ACO) approach to solve no-wait flowshop scheduling problem (NW-FSSP). ACO algorithm so developed has been coded on Matlab computer application. The paper covers detailed steps to apply ACO and focuses on judging the strength of ACO in relation to other solution techniques previously applied to solve no-wait flowshop problem. The general purpose approach was able to find reasonably accurate solutions for almost all the problems under consideration and was able to handle a fairly large spectrum of problems with far reduced CPU effort. Careful scrutiny of the results reveals that the algorithm presented results better than other approaches like Genetic algorithm and Tabu Search heuristics etc; earlier applied to solve NW-FSSP data sets.

Keywords: no-wait, flowshop, scheduling, ant colony optimization (ACO), makespan

Procedia PDF Downloads 401
569 A Novel Algorithm for Production Scheduling

Authors: Ali Mohammadi Bolban Abad, Fariborz Ahmadi

Abstract:

Optimization in manufacture is a method to use limited resources to obtain the best performance and reduce waste. In this paper a new algorithm based on eurygaster life is introduced to obtain a plane in which task order and completion time of resources are defined. Evaluation results show our approach has less make span when the resources are allocated with some products in comparison to genetic algorithm.

Keywords: evolutionary computation, genetic algorithm, particle swarm optimization, NP-Hard problems, production scheduling

Procedia PDF Downloads 352
568 Cognitive Science Based Scheduling in Grid Environment

Authors: N. D. Iswarya, M. A. Maluk Mohamed, N. Vijaya

Abstract:

Grid is infrastructure that allows the deployment of distributed data in large size from multiple locations to reach a common goal. Scheduling data intensive applications becomes challenging as the size of data sets are very huge in size. Only two solutions exist in order to tackle this challenging issue. First, computation which requires huge data sets to be processed can be transferred to the data site. Second, the required data sets can be transferred to the computation site. In the former scenario, the computation cannot be transferred since the servers are storage/data servers with little or no computational capability. Hence, the second scenario can be considered for further exploration. During scheduling, transferring huge data sets from one site to another site requires more network bandwidth. In order to mitigate this issue, this work focuses on incorporating cognitive science in scheduling. Cognitive Science is the study of human brain and its related activities. Current researches are mainly focused on to incorporate cognitive science in various computational modeling techniques. In this work, the problem solving approach of human brain is studied and incorporated during the data intensive scheduling in grid environments. Here, a cognitive engine is designed and deployed in various grid sites. The intelligent agents present in CE will help in analyzing the request and creating the knowledge base. Depending upon the link capacity, decision will be taken whether to transfer data sets or to partition the data sets. Prediction of next request is made by the agents to serve the requesting site with data sets in advance. This will reduce the data availability time and data transfer time. Replica catalog and Meta data catalog created by the agents assist in decision making process.

Keywords: data grid, grid workflow scheduling, cognitive artificial intelligence

Procedia PDF Downloads 368
567 An Efficient Hybrid Approach Based on Multi-Agent System and Emergence Method for the Integration of Systematic Preventive Maintenance Policies

Authors: Abdelhadi Adel, Kadri Ouahab

Abstract:

This paper proposes a hybrid algorithm for the integration of systematic preventive maintenance policies in hybrid flow shop scheduling to minimize makespan. We have implemented a problem-solving approach for optimizing the processing time, methods based on metaheuristics. The proposed approach is inspired by the behavior of the human body. This hybridization is between a multi-agent system and inspirations of the human body, especially genetics. The effectiveness of our approach has been demonstrated repeatedly in this paper. To solve such a complex problem, we proposed an approach which we have used advanced operators such as uniform crossover set and single point mutation. The proposed approach is applied to three preventive maintenance policies. These policies are intended to maximize the availability or to maintain a minimum level of reliability during the production chain. The results show that our algorithm outperforms existing algorithms. We assumed that the machines might be unavailable periodically during the production scheduling.

Keywords: multi-agent systems, emergence, genetic algorithm, makespan, systematic maintenance, scheduling, hybrid flow shop scheduling

Procedia PDF Downloads 308
566 A Constrained Neural Network Based Variable Neighborhood Search for the Multi-Objective Dynamic Flexible Job Shop Scheduling Problems

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

In this paper, a new neural network based variable neighborhood search is proposed for the multi-objective dynamic, flexible job shop scheduling problems. The neural network controls the problems' constraints to prevent infeasible solutions, while the Variable Neighborhood Search (VNS) applies moves, based on the critical block concept to improve the solutions. Two approaches are used for managing the constraints, in the first approach, infeasible solutions are modified according to the constraints, after the moves application, while in the second one, infeasible moves are prevented. Several neighborhood structures from the literature with some modifications, also new structures are used in the VNS. The suggested neighborhoods are more systematically defined and easy to implement. Comparison is done based on a multi-objective flexible job shop scheduling problem that is dynamic because of the jobs different release time and machines breakdowns. The results show that the presented method has better performance than the compared VNSs selected from the literature.

Keywords: constrained optimization, neural network, variable neighborhood search, flexible job shop scheduling, dynamic multi-objective optimization

Procedia PDF Downloads 321
565 Challenges in the Management of Her2 Neu Positive Breast Cancer Patients: Real World Data from India

Authors: Praveen Adusumilli, Meher Lakshmi Konatam, Sadashivudu Gundeti, Stalin Bala

Abstract:

The invention of trastuzumab has changed the treatment of breast cancer and lives of many patients all over the world. Despite many patients getting benefitted from the drug, it is out of reach for most of the patients. There is very limited real world data regarding the epidemiology and clinical outcome of Her2neu positive breast cancer patients. Materials and Methods: This is a retrospective analysis of breast cancer patients presenting to a tertiary care cancer centre in Southern India from 2007 to2013. All early and locally advanced breast cancer patients, who were Her2neu 3+ on IHC are included in the study and evaluated in terms of epidemiology, 3-year disease free survival (DFS)and 5-year overall survival(OS). Chemotherapy regimens used were-FAC 6 cycles or AC 4 cycles followed by 12 cycles of weekly paclitaxel . Trastuzumab was given after 6 cycles of FAC or weekly with paclitaxel followed by 3weekly maintenance until 1 year. Results: Over the period of this study there were 885 newly diagnosed cases of carcinoma breast, of which 242 (27%) were Her2neu positive, 360(40%) were hormone receptor positive, and 212(24%) were triple negative. A total of 71(8%) were Her2neu equivocal of which only 10 patients got FISH test done. Of the 212 newly diagnosed patients, only 74 (29%) opted to have standard of care therapy with trastuzumab at our centre, out of which 52(24%), 8(3%), received under insurance, paying basis respectively. 14(9%) patients received the care as part of clinical trial program (ALTTO trial). 7 (9.72%) patients developed decrease of ejection fraction by greater than 10%, requiring stoppage of trastuzumab out of which 5 were restarted in 2 months. Patients receiving trastuzumab along with chemotherapy had longer 3year DFS 92% vs. 60% (p value<0.0001) when compared to chemotherapy alone. 5 year OS was 87% vs 44% (p-value <0.0001) compared to chemotherapy alone. Conclusion: Trastuzumab with chemotherapy improves the DFS and OS in Her2neu positive patients. The biggest constraint is the cost of the treatment and absence of universal health security net to treat all patients with this diagnosis.

Keywords: breast cancer, Her 2 neu positive, real world data, Trastuzumab

Procedia PDF Downloads 143
564 Nursing Experience for a Lung Cancer Patient Undergoing First Time Concurrent Chemotherapy and Radiation Therapy

Authors: Hui Ling Chen

Abstract:

This article describes the experience of caring for a 68-year-old lung cancer patient undergoing the initial stage of concurrent chemotherapy and radiation therapy during the period of October 21 to November 16. In this study, the author collected data through observation, interviews, medical examination, and the use of Roy’s adaptation model as a guide for data collection and assessment. This study confirmed that chemotherapy induced nausea and vomiting, and radiation therapy impaired skin integrity. At the same time, the patient experienced an anxious reaction to the initial cancer diagnosis and the insertion of subcutaneous infusion ports at the start of medical treatment. Similarly, the patient’s wife shares his anxiety, not to mention the feeling of inadequacy from the lack of training in cancer care. In response, the nursing intervention strategy has included keeping the patient and his family informed of his treatment progress, transfer of cancer care knowledge, and providing them with spiritual support. For example, the nursing staff has helped them draw up a mutually agreeable dietary plan that best suits the wife’s cooking skills, provided them with knowledge in pre- and post-radiation skin care, as well as means to cope with nausea and vomiting reactions. The nursing staff has also worked on building rapport with the patient and his spouse, providing them with encouragement, caring attention and companionship. After the patient was discharged from the hospital, the nursing staff followed up with caring phone calls to help the patient and his family make life-style adjustments to normalcy. The author hopes that his distinctive nursing experience can be useful as a reference for the clinical care of lung cancer patients undergoing the initial stage of concurrent chemotherapy and radiation therapy treatment.

Keywords: lung cancer, initiate diagnosis, concurrent chemotherapy and radiation therapy, nursing care

Procedia PDF Downloads 119