Log in

Relevant bibliographies by topics / Break scheduling / Journal articles

Journal articles on the topic 'Break scheduling'

To see the other types of publications on this topic, follow the link: Break scheduling.

Author: Grafiati

Published: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Break scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

OSMAN, Hesham, Marwan AMMAR, and Moheeb EL-SAID. "OPTIMAL SCHEDULING OF WATER NETWORK REPAIR CREWS CONSIDERING MULTIPLE OBJECTIVES." JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT 23, no. 1 (January 19, 2017): 28–36. http://dx.doi.org/10.3846/13923730.2014.948911.

Full text

Abstract:

Water main breaks disrupt water services and impact traffic flow along congested city roads. Dispatching water pipe repair crews needs to consider several factors that include: 1) the priority of repair site; 2) the suitability and efficiency of the construction crew in repairing a particular break type; and 3) the time required for crews to travel between break sites. This paper presents a simulation-based multi-objective optimization model to schedule repair crews across water network break sites in an urban setting. Discrete-event simulation models for the water pipe repair process are developed to account for various repair methods. These models are subsequently integrated within a GA-based multi-objective optimization model that considers the following objectives: 1) minimizing the total repair time required to complete all breaks; 2) minimizing the total cost to complete the breaks; and 3) minimizing the cumulative impact of all breaks incident on road users and water customers. A case study for the water network on the City of Damietta, Egypt is used to demonstrate the capabilities of the model. Results show a 21% reduction in repair time and 50% reduction in user impact compared to heuristic crew allocation methods used by the water utility.

APA, Harvard, Vancouver, ISO, and other styles

2

Aykin, Turgut. "Optimal Shift Scheduling with Multiple Break Windows." Management Science 42, no. 4 (April 1996): 591–602. http://dx.doi.org/10.1287/mnsc.42.4.591.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sungur, Banu, Cemal Özgüven, and Yasemin Kariper. "Shift scheduling with break windows, ideal break periods, and ideal waiting times." Flexible Services and Manufacturing Journal 29, no. 2 (December 28, 2015): 203–22. http://dx.doi.org/10.1007/s10696-015-9234-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Topaloglu, Seyda, and Irem Ozkarahan. "Implicit optimal tour scheduling with flexible break assignments." Computers & Industrial Engineering 44, no. 1 (January 2003): 75–89. http://dx.doi.org/10.1016/s0360-8352(02)00185-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

CHEN, Shijun, Yindong SHEN, Xuan SU, and Heming CHEN. "A Crew Scheduling with Chinese Meal Break Rules." Journal of Transportation Systems Engineering and Information Technology 13, no. 2 (April 2013): 90–95. http://dx.doi.org/10.1016/s1570-6672(13)60105-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Brouwer, Andries E., Gerhard F. Post, and Gerhard J. Woeginger. "Tight bounds for break minimization in tournament scheduling." Journal of Combinatorial Theory, Series A 115, no. 6 (August 2008): 1065–68. http://dx.doi.org/10.1016/j.jcta.2007.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Qu, Chang Zheng, Hong Qiang Gu, Hui Song, and Guang Yu Liu. "Maintenance Project Scheduling Model Considered Flexible Resource with Capability Difference." Advanced Materials Research 791-793 (September 2013): 1566–69. http://dx.doi.org/10.4028/www.scientific.net/amr.791-793.1566.

Full text

Abstract:

Maintenance task scheduling during mission break is described as flexible resource constraint project scheduling problem, and flexible resource constraint maintenance task scheduling model is established. Since capability level of flexible resource is different, the thesis establishes maintenance task scheduling model considering capability difference. To resolve the model, a particle swarm optimization (PSO) algorithm based on activity list is presented. At last, a case study is present.

APA, Harvard, Vancouver, ISO, and other styles

8

Ohki, Makoto. "Shift Scheduling of Short Time Workers in Large-Scale Home Improvement Center by using Cooperative Evolution." MENDEL 23, no. 1 (June 1, 2017): 21–28. http://dx.doi.org/10.13164/mendel.2017.1.021.

Full text

Abstract:

There are a lot of large-scale Home Improvement Center (HIC) in Japan. In the large-scale HIC,about hundred short time workers are registered. And about forty workers are working every day. A managercreates a monthly shift schedule. The manager selects the workers required for each working day, assigns theworking time and break time for each worker and also work placement. Because there are many requirementsfor the scheduling, the scheduling consumes time costs and efforts. Therefore, we propose the technique to createand optimize the schedule of the short time workers in order to reduce the burden of the manager. A cooperativeevolution is applied for generating and optimizing the shift schedule of short time worker. Several problems hasbeen found in carrying out this research. This paper proposes techniques to automatically create and optimize theshift schedule of workers in large-scale HIC by using a Cooperative Evolution (CE), to solve the situation thatmany workers concentrate in a speci c time zone, and to solve the situation where many breaks are concentratedin a speci c break time zone, and an effective mutation operators.

APA, Harvard, Vancouver, ISO, and other styles

9

Cui, Chong, Xing Chen Zhang, and Jun Hua Chen. "The Model and Algorithm of Using Shunting Locomotive for Marshalling Stations." Applied Mechanics and Materials 505-506 (January 2014): 1097–101. http://dx.doi.org/10.4028/www.scientific.net/amm.505-506.1097.

Full text

Abstract:

The scheduling problem of shunting locomotive in marshalling station can be described as a single machine scheduling problem with distinct due window, the paper established the model of using shunting locomotive by taking the minimized the total number of tardy trains as targets. The paper proposed an adjustment method for train break-up and make-up sequence as a model algorithm, the model algorithm can be used to get the optimal train break-up sequence and make-up sequence. Based on the actual data of Fuyang North station, the paper used matlab program to realize the model algorithm, and got the optimal train break-up sequence and make-up sequence of Fuyang North station. The algorithm was proved feasible and effective.

APA, Harvard, Vancouver, ISO, and other styles

10

Lim, Gino J., Arezou Mobasher, Jonathan F. Bard, and Amirhossein Najjarbashi. "Nurse scheduling with lunch break assignments in operating suites." Operations Research for Health Care 10 (September 2016): 35–48. http://dx.doi.org/10.1016/j.orhc.2016.07.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Widl, Magdalena, and Nysret Musliu. "The break scheduling problem: complexity results and practical algorithms." Memetic Computing 6, no. 2 (March 25, 2014): 97–112. http://dx.doi.org/10.1007/s12293-014-0131-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Di Pasquale, Valentina, Fabio Fruggiero, Raffaele Iannone, and Salvatore Miranda. "A model for break scheduling assessment in manufacturing systems." Computers & Industrial Engineering 111 (September 2017): 563–80. http://dx.doi.org/10.1016/j.cie.2017.05.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Beer, Andreas, Johannes Gartner, Nysret Musliu, Werner Schafhauser, and Wolfgang Slany. "An AI-Based Break-Scheduling System for Supervisory Personnel." IEEE Intelligent Systems 25, no. 2 (March 2010): 60–73. http://dx.doi.org/10.1109/mis.2010.40.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Li, Kai, Shuling Xu, and Hong Fu. "Work-break scheduling with real-time fatigue effect and recovery." International Journal of Production Research 58, no. 3 (April 1, 2019): 689–702. http://dx.doi.org/10.1080/00207543.2019.1598600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Bechtold, Stephen E., and Larry W. Jacobs. "Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling." Management Science 36, no. 11 (November 1990): 1339–51. http://dx.doi.org/10.1287/mnsc.36.11.1339.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Aykin, T. "A Composite Branch and Cut Algorithm for Optimal Shift Scheduling with Multiple Breaks and Break Windows." Journal of the Operational Research Society 49, no. 6 (June 1998): 603. http://dx.doi.org/10.2307/3010669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Aykin, T. "A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows." Journal of the Operational Research Society 49, no. 6 (June 1998): 603–15. http://dx.doi.org/10.1057/palgrave.jors.2600472.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Aykin, T. "A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows." Journal of the Operational Research Society 49, no. 6 (1998): 603–15. http://dx.doi.org/10.1038/sj.jors.2600472.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Rijal, Arpan, Marco Bijvank, Asvin Goel, and René de Koster. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities." Transportation Science 55, no. 3 (May 2021): 725–46. http://dx.doi.org/10.1287/trsc.2020.1029.

Full text

Abstract:

Scheduling the availability of order pickers is crucial for effective operations in a distribution facility with manual order pickers. When order-picking activities can only be performed in specific time windows, it is essential to jointly solve the order picker shift scheduling problem and the order picker planning problem of assigning and sequencing individual orders to order pickers. This requires decisions regarding the number of order pickers to schedule, shift start and end times, break times, as well as the assignment and timing of order-picking activities. We call this the order picker scheduling problem and present two formulations. A branch-and-price algorithm and a metaheuristic are developed to solve the problem. Numerical experiments illustrate that the metaheuristic finds near-optimal solutions at 80% shorter computation times. A case study at the largest supermarket chain in The Netherlands shows the applicability of the solution approach in a real-life business application. In particular, different shift structures are analyzed, and it is concluded that the retailer can increase the minimum compensated duration for employed workers from six hours to seven or eight hours while reducing the average labor cost with up to 5% savings when a 15-minute flexibility is implemented in the scheduling of break times.

APA, Harvard, Vancouver, ISO, and other styles

20

Kletzander, Lucas, and Nysret Musliu. "Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 421–29. http://dx.doi.org/10.1609/icaps.v30i1.6688.

Full text

Abstract:

When scheduling drivers for public transport, in addition to covering the demand and dealing with the spatial dimension, a range of legal requirements, collective agreements and company policies need to be respected. The level of concentration required while driving leads to strict rules for break assignments. This results in a complex problem where creating cost-efficient and employee-friendly schedules is challenging. This paper deals with bus driver scheduling using the rules of the Austrian collective agreement for private omnibus providers. The contributions are the formalization of the complex Austrian rules for bus drivers, a new set of publicly available instances based on the characteristics of real-life instances, and a metaheuristic solution approach for the problem. The algorithm was able to significantly improve the solutions of real-life instances and is evaluated on the generated instances. Further we provide insight in the necessity of objectives for employee satisfaction and their effects. Our method can even be successfully applied to improve results on a problem with very different constraints from Brasil.

APA, Harvard, Vancouver, ISO, and other styles

21

Kletzander, Lucas, Nysret Musliu, and Pascal Van Hentenryck. "Branch and Price for Bus Driver Scheduling with Complex Break Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 13 (May 18, 2021): 11853–61. http://dx.doi.org/10.1609/aaai.v35i13.17408.

Full text

Abstract:

This paper presents a Branch and Price approach for a real-life Bus Driver Scheduling problem with a complex set of break constraints. The column generation uses a set partitioning model as master problem and a resource constrained shortest path problem as subproblem. Due to the complex constraints, the branch and price algorithm adopts several novel ideas to improve the column generation in the presence of a high-dimensional subproblem, including exponential arc throttling and a dedicated two-stage dominance algorithm. Evaluation on a publicly available set of benchmark instances shows that the approach provides the first provably optimal solutions for small instances, improving best-known solutions or proving them optimal for 48 out of 50 instances, and yielding an optimality gap of less than 1% for more than half the instances.

APA, Harvard, Vancouver, ISO, and other styles

22

Zhang, Hong, Heng Li, and C. M. Tam. "Particle Swarm Optimization for Preemptive Scheduling under Break and Resource-Constraints." Journal of Construction Engineering and Management 132, no. 3 (March 2006): 259–67. http://dx.doi.org/10.1061/(asce)0733-9364(2006)132:3(259).

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Chauhan, Piyush, and Nitin. "Fault Tolerant PLBGSA: Precedence Level Based Genetic Scheduling Algorithm for P2P Grid." Journal of Engineering 2013 (2013): 1–13. http://dx.doi.org/10.1155/2013/749132.

Full text

Abstract:

Due to monetary limitation, small organizations cannot afford high end supercomputers to solve highly complex tasks. P2P (peer to peer) grid computing is being used nowadays to break complex task into subtasks in order to solve them on different grid resources. Workflows are used to represent these complex tasks. Finishing such complex task in a P2P grid requires scheduling subtasks of workflow in an optimized manner. Several factors play their part in scheduling decisions. The genetic algorithm is very useful in scheduling DAG (directed acyclic graph) based task. Benefit of a genetic algorithm is that it takes into consideration multiple criteria while scheduling. In this paper, we have proposed a precedence level based genetic algorithm (PLBGSA), which yields schedules for workflows in a decentralized fashion. PLBGSA is compared with existing genetic algorithm based scheduling techniques. Fault tolerance is a desirable trait of a P2P grid scheduling algorithm due to the untrustworthy nature of grid resources. PLBGSA handles faults efficiently.

APA, Harvard, Vancouver, ISO, and other styles

24

Türker, Turgay, and Ayhan Demiriz. "An Integrated Approach for Shift Scheduling and Rostering Problems with Break Times for Inbound Call Centers." Mathematical Problems in Engineering 2018 (November 21, 2018): 1–19. http://dx.doi.org/10.1155/2018/7870849.

Full text

Abstract:

It may be very difficult to achieve the optimal shift schedule in call centers which have highly uncertain and peaked demand during short time periods. Overlapping shift systems are usually designed for such cases. This paper studies shift scheduling and rostering problems for inbound call centers where overlapping shift systems are used. An integer programming model that determines which shifts to be opened and how many operators to be assigned to these shifts is proposed for the shift scheduling problem. For the rostering problem both integer programming and constraint programming models are developed to determine assignments of operators to all shifts, weekly days-off, and meal and relief break times of the operators. The proposed models are tested on real data supplied by an outsource call center and optimal results are found in an acceptable computation time. An improvement of 15% in the objective function compared to the current situation is observed with the proposed model for the shift scheduling problem. The computational performances of the proposed integer and constraint programming models for the rostering problem are compared using real data observed at a call center and simulated test instances. In addition, benchmark instances are used to compare our Constraint Programming (CP) approach with the existing models. The results of the comprehensive computational study indicate that the constraint programming model runs more efficiently than the integer programming model for the rostering problem. The originality of this research can be attributed to two contributions: (a) a model for shift scheduling problem and two models for rostering problem are presented in detail and compared using real data and (b) the rostering problem is considered as a task-resource allocation and considerably shorter computation times are obtained by modeling this new problem via CP.

APA, Harvard, Vancouver, ISO, and other styles

25

Hapsari, Chaterine Alvina Prima, Deny Ratna Yuniartha, and Luddy Indra Purnama. "Tour and Break Scheduling for Shift Operators in Hard Disk Drive Manufacturer." Procedia Manufacturing 4 (2015): 504–12. http://dx.doi.org/10.1016/j.promfg.2015.11.069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Pasquale, Valentina Di, Valentina De Simone, Martina Radano, and Salvatore Miranda. "Work break scheduling using wrist wearable devices: a conceptual and practical model." Procedia Computer Science 217 (2023): 1810–19. http://dx.doi.org/10.1016/j.procs.2022.12.381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

CASANOVA, HENRI. "NETWORK MODELING ISSUES FOR GRID APPLICATION SCHEDULING." International Journal of Foundations of Computer Science 16, no. 02 (April 2005): 145–62. http://dx.doi.org/10.1142/s0129054105002929.

Full text

Abstract:

The dominant trend in scientific computing today is the establishment of platforms that span multiple institutions to support applications at unprecedented scales. On most distributed computing platforms a requirement to achieve high performance is the careful scheduling of distributed application components onto the available resources. While scheduling has been an active area of research for many decades most of the platform models traditionally used in scheduling research, and in particular network models, break down for platforms spanning wide-area networks. In this paper we examine network modeling issues for large-scale platforms from the perspective of scheduling. The main challenge we address is the development of models that are sophisticated enough to be more realistic than those traditionally used in the field, but simple enough that they are still amenable to analysis. In particular, we discuss issues of bandwidth sharing and topology modeling. Also, while these models can be used to define and reason about realistic scheduling problems, we show that they also provide a good basis for fast simulation, which is the typical method to evaluate scheduling algorithms, as demonstrated in our implementation of the SIMGRID simulation framework.

APA, Harvard, Vancouver, ISO, and other styles

28

Belavenutti, Pedro, Alan A. Ager, Michelle A. Day, and Woodam Chung. "Multi-Objective Scheduling of Fuel Treatments to Implement a Linear Fuel Break Network." Fire 6, no. 1 (December 20, 2022): 1. http://dx.doi.org/10.3390/fire6010001.

Full text

Abstract:

We developed and applied a spatial optimization algorithm to prioritize forest and fuel management treatments within a proposed linear fuel break network on a 0.5 million ha Western US national forest. The large fuel break network, combined with the logistics of conducting forest and fuel management, requires that treatments be partitioned into a sequence of discrete projects, individually implemented over the next 10–20 years. The original plan for the network did not consider how linear segments would be packaged into projects and how projects would be prioritized for treatments over time, as the network is constructed. Using our optimization algorithm, we analyzed 13 implementation scenarios where size-constrained projects were prioritized based on predicted wildfire hazard, treatment costs, and harvest revenues. We found that among the scenarios, the predicted net revenue ranged from USD 3495 to USD 6642 ha−1, and that prioritizing the wildfire encounter rate reduced the net revenue and harvested timber. We demonstrate how the tradeoffs could be minimized using a multi-objective optimization approach. We found that the most efficient implementation scale was a sequence of relatively small projects that treated 300 ha ± 10% versus larger projects with a larger treated area. Our study demonstrates a decision support model for multi-objective optimization to implement large fuel break networks such as those being proposed or implemented in many fire-prone regions around the globe.

APA, Harvard, Vancouver, ISO, and other styles

29

Brusco, Michael J., and Larry W. Jacobs. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling." Management Science 46, no. 12 (December 2000): 1630–41. http://dx.doi.org/10.1287/mnsc.46.12.1630.12074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Bjarnason, Georg A. "Can individualized sunitinib dose and schedule changes optimize outcomes for kidney cancer patients?" Canadian Urological Association Journal 10, no. 11-12 (December 15, 2016): 252. http://dx.doi.org/10.5489/cuaj.4293.

Full text

Abstract:

The recommended starting dose and schedule for sunitinib is 50 mg daily for 28 days, followed by a 14-day break with significant dose reductions to 37.5 mg (75% of starting dose), and then 25 mg (50% of starting dose) on the same schedule (four/two schedule). There are several reasons why these dose and scheduling recommendations may not be optimal for most patients, as outlined below.

APA, Harvard, Vancouver, ISO, and other styles

31

KUMAR, SAURABH, SUPRAKASH GUPTA, BEHZAD GHODRATI, and UDAY KUMAR. "AN APPROACH FOR RISK ASSESSMENT OF RAIL DEFECTS." International Journal of Reliability, Quality and Safety Engineering 17, no. 04 (August 2010): 291–311. http://dx.doi.org/10.1142/s0218539310003822.

Full text

Abstract:

Rail defects appear in a greater variety and frequency due to higher axle loads and increasing traffic density in passenger and freight trains. Many of these rail defects, if left undetected, can develop into rail breaks, which may lead to train derailments. Reduction in the number of such catastrophic events requires huge investments on inspection and maintenance activities. Therefore proper maintenance planning and risk assessment is required to reduce the rail maintenance cost without compromising safety. In this paper, an approach has been developed for risk assessment of rail defects to support the decision-making process during scheduling of rail inspection and grinding frequency, based on the type of defect and its risk of occurring and developing into a rail break. The approach will help in increasing the safety of passengers and rolling stock as well as reducing the overall rail maintenance cost, as it helps in making effective decisions related to inspection frequency (i.e. resource allocation according to the need). The approach is presented with the aid of a case study from the Swedish National Rail Administration (Banverket). Both, quantitative and qualitative analysis technique has been used in this paper to assess the risk of occurrence of a rail defect and its development into a rail break.

APA, Harvard, Vancouver, ISO, and other styles

32

Lisova, Elena, Marina Gutiérrez, Wilfried Steiner, Elisabeth Uhlemann, Johan Åkerberg, Radu Dobrin, and Mats Björkman. "Protecting Clock Synchronization: Adversary Detection through Network Monitoring." Journal of Electrical and Computer Engineering 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/6297476.

Full text

Abstract:

Nowadays, industrial networks are often used for safety-critical applications with real-time requirements. Such applications usually have a time-triggered nature with message scheduling as a core property. Scheduling requires nodes to share the same notion of time, that is, to be synchronized. Therefore, clock synchronization is a fundamental asset in real-time networks. However, since typical standards for clock synchronization, for example, IEEE 1588, do not provide the required level of security, it raises the question of clock synchronization protection. In this paper, we identify a way to break synchronization based on the IEEE 1588 standard, by conducting a man-in-the-middle (MIM) attack followed by a delay attack. A MIM attack can be accomplished through, for example, Address Resolution Protocol (ARP) poisoning. Using the AVISPA tool, we evaluate the potential to perform a delay attack using ARP poisoning and analyze its consequences showing both that the attack can, indeed, break clock synchronization and that some design choices, such as a relaxed synchronization condition mode, delay bounding, and using knowledge of environmental conditions, can make the network more robust/resilient against these kinds of attacks. Lastly, a Configuration Agent is proposed to monitor and detect anomalies introduced by an adversary performing attacks targeting clock synchronization.

APA, Harvard, Vancouver, ISO, and other styles

33

Ghaderi, Nima, Joseph Jung, Sarah C. Brüningk, Ajay Subramanian, Lauren Nassour, and Jeffrey Peacock. "A Century of Fractionated Radiotherapy: How Mathematical Oncology Can Break the Rules." International Journal of Molecular Sciences 23, no. 3 (January 24, 2022): 1316. http://dx.doi.org/10.3390/ijms23031316.

Full text

Abstract:

Radiotherapy is involved in 50% of all cancer treatments and 40% of cancer cures. Most of these treatments are delivered in fractions of equal doses of radiation (Fractional Equivalent Dosing (FED)) in days to weeks. This treatment paradigm has remained unchanged in the past century and does not account for the development of radioresistance during treatment. Even if under-optimized, deviating from a century of successful therapy delivered in FED can be difficult. One way of exploring the infinite space of fraction size and scheduling to identify optimal fractionation schedules is through mathematical oncology simulations that allow for in silico evaluation. This review article explores the evidence that current fractionation promotes the development of radioresistance, summarizes mathematical solutions to account for radioresistance, both in the curative and non-curative setting, and reviews current clinical data investigating non-FED fractionated radiotherapy.

APA, Harvard, Vancouver, ISO, and other styles

34

Peiris, Casey L., Gráinne O’Donoghue, Lewis Rippon, Dominic Meyers, Andrew Hahne, Marcos De Noronha, Julia Lynch, and Lisa C. Hanson. "Classroom Movement Breaks Reduce Sedentary Behavior and Increase Concentration, Alertness and Enjoyment during University Classes: A Mixed-Methods Feasibility Study." International Journal of Environmental Research and Public Health 18, no. 11 (May 24, 2021): 5589. http://dx.doi.org/10.3390/ijerph18115589.

Full text

Abstract:

This mixed-methods study aimed to determine the feasibility of incorporating movement breaks into university classes in terms of acceptability (disruption, engagement, satisfaction), practicality (ease of scheduling and conducting breaks) and efficacy (sedentary time, concentration, alertness, enjoyment). Movement breaks of five to 10 min duration were scheduled after 20 min of sedentary time during 2-h classes. Classes without movement breaks were used as a comparison. Data were collected using surveys, objective physical activity monitoring and focus group interviews of students (n = 85) and tutors (n = 6). Descriptive statistics (quantitative data) and independent coding and thematic analysis (qualitative data) were completed. Students (mean age 23 ± 2 years, 69% female) actively engaged in movement breaks with no adverse events. Movement breaks were perceived to be beneficial for concentration, engagement and productivity. Timing of the break was perceived to be important to enhance the benefit and reduce disruption. Students preferred outdoor or competitive movement breaks. Students spent 13 min less time sitting (95%CI 10 to 17), took 834 more steps (95%CI 675 to 994) and had higher levels of concentration, alertness and enjoyment (p < 0.001) in classes with movement breaks compared to classes without. Classroom movement breaks are feasible and may be considered for incorporation into university classes to reduce sedentary behaviour and increase physical activity, alertness, concentration and enjoyment.

APA, Harvard, Vancouver, ISO, and other styles

35

Zhao, Zhonghao, Boping Xiao, Naichao Wang, Xiaoyuan Yan, and Lin Ma. "Selective Maintenance Optimization for a Multi-State System Considering Human Reliability." Symmetry 11, no. 5 (May 9, 2019): 652. http://dx.doi.org/10.3390/sym11050652.

Full text

Abstract:

In an actual industrial or military operations environment, a multi-state system (MSS) consisting of multi-state components often needs to perform multiple missions in succession. To improve the probability of the system successfully completing the next mission, all the maintenance activities need to be performed during maintenance breaks between any two consecutive missions under limited maintenance resources. In such case, selective maintenance is a widely used maintenance policy. As a typical discrete mathematics problem, selective maintenance has received widespread attention. In this work, a selective maintenance model considering human reliability for multi-component systems is investigated. Each maintenance worker can be in one of multiple discrete working levels due to their human error probability (HEP). The state of components after maintenance is assumed to be random and follow an identified probability distribution. To solve the problem, this paper proposes a human reliability model and a method to determine the state distribution of components after maintenance. The objective of selective maintenance scheduling is to find the maintenance action with the optimal reliability for each component in a maintenance break subject to constraints of time and cost. In place of an enumerative method, a genetic algorithm (GA) is employed to solve the complicated optimization problem taking human reliability into account. The results show the importance of considering human reliability in selective maintenance scheduling for an MSS.

APA, Harvard, Vancouver, ISO, and other styles

36

Roboredo, Marcos Costa, Luiz Aizemberg, Artur Alves Pessoa, and João Carlos C. B. Soares de Mello. "SCHEDULING THE BRAZILIAN FOOTBALL LEAGUE MINIMIZING EXTENDED CARRY-OVER EFFECTS ASSOCIATED TO STRENGTH GROUPS." Engevista 16, no. 1 (April 21, 2014): 102. http://dx.doi.org/10.22409/engevista.v16i1.634.

Full text

Abstract:

The Brazilian football league is a classical mirrored double round robin tournament with an even number of teams and place constraints. That league is composed of divisions (series) where the two strongest are A and B, in this order. Currently, the Serie A top four teams and the Brazilian Cup winner guarantee together the access to the important Libertadores Cup while the Serie B top four teams guarantee the access to Serie A. We consider a type of carry-over effect that occurs in the schedule when a team meets two teams from either a strong or a weak group in two consecutive rounds. A break occurs when a team plays at home (away) in two consecutive rounds. In this paper, we consider a scheduling problem that limits the number of breaks and minimizes the total number of the effects. We show that previously proposed techniques can be extended to solve this variation. In addition, we use a hypothesis test to provide an evidence that teams from Serie B in last season with access to Serie A at current season form a weak group while teams with access to Libertadores Cup and playing Serie A at the current season form a strong group.

APA, Harvard, Vancouver, ISO, and other styles

37

Janaro, Ralph E., and Stephen E. Bechtold. "A Study of the Reduction of Fatigue Impact on Productivity through Optimal Rest Break Scheduling." Human Factors: The Journal of the Human Factors and Ergonomics Society 27, no. 4 (August 1985): 459–66. http://dx.doi.org/10.1177/001872088502700409.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Marichelvam, M. K., and M. Geetha. "A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down." International Journal of Enterprise Network Management 10, no. 2 (2019): 162. http://dx.doi.org/10.1504/ijenm.2019.10022254.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Marichelvam, M. K., and M. Geetha. "A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down." International Journal of Enterprise Network Management 10, no. 2 (2019): 162. http://dx.doi.org/10.1504/ijenm.2019.100544.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Castro, Pedro M., Iiro Harjunkoski, and Ignacio E. Grossmann. "Discrete and continuous-time formulations for dealing with break periods: Preemptive and non-preemptive scheduling." European Journal of Operational Research 278, no. 2 (October 2019): 563–77. http://dx.doi.org/10.1016/j.ejor.2019.04.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Pylman, Stacey. "In co-planning, scheduling is just the tip of the iceberg." Phi Delta Kappan 100, no. 4 (November 26, 2018): 44–48. http://dx.doi.org/10.1177/0031721718815673.

Full text

Abstract:

A great deal of teacher planning involves an invisible process of envisioning how plans might unfold in the classroom. Novice teachers can benefit from seeing how experienced teachers work through this process, but, too often, co-planning sessions between mentors and novices focus on selecting activities to fill out a lesson, rather than delving into the reasons for those choices. Stacey Pylman recommends that mentors make their co-planning sessions into a time for novices to learn. As a reminder of the elements of an effective planning session, she offers the acronym ICEBERG: Intentionally prepare, Clarify content, Explain why, Break for questions, Envision aloud, Return to the objective, and Gradually release decisions.

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Junjun, Lixing Yan, and Bowei Xu. "Research on Multi-Equipment Cluster Scheduling of U-Shaped Automated Terminal Yard and Railway Yard." Journal of Marine Science and Engineering 11, no. 2 (February 15, 2023): 417. http://dx.doi.org/10.3390/jmse11020417.

Full text

Abstract:

A new layout of the U-shaped automated terminal is more convenient to connect between the terminal and the railway. In this study, a sort of cluster scheduling method for multiple equipment between a U-shaped automated terminal yard and a railway yard is proposed. The innovation points are as follows: (1) Considering that the rail gantry crane (RGC), intelligent guided vehicle (IGV), and double cantilever rail crane (DCRC) usually work in groups, they are grouped and cluster-scheduled. (2) A hybrid integer programming model is established to minimize container transit times, and non-crossing constraints and safe distance constraints are included to reflect complex interactions among terminal equipment. (3) An ADMM (Alternating Direction Method of Multipliers)-based framework is proposed to dualize the hard-edge constraints and break the cluster scheduling problem down into a specific subproblem set of RGCs, IGVs, and DCRCs, and their time cost is iteratively adjusted to improve the solution quality. The experiment results show that the solution of the proposed method, which can effectively avoid IGV conflict, is better than that of the standard Lagrange relaxation (LR) when the number of equipments participating in scheduling increases. This study on multi-equipment cluster scheduling is conducive to improving the collaborative handling and continuous work of terminal equipment, and improving the efficiency of the automated terminal and the sea–rail intermodal transport.

APA, Harvard, Vancouver, ISO, and other styles

43

Peng, Wei, Liang Fa Shen, and De Yin Liu. "Construction Project Scheduling Risk Analysis Using Event Chain Methodology: An Example of Airport Terminal Project." Applied Mechanics and Materials 209-211 (October 2012): 1330–38. http://dx.doi.org/10.4028/www.scientific.net/amm.209-211.1330.

Full text

Abstract:

This paper describes a new perspective to consider and quantify uncertainty in construction schedules. In the study, a methodology was presented by modeling construction project scheduling using event chains, classification of the events and event chains, identification of critical events, analysis of effect of the events on project duration, and chance of project completion. To demonstrate the applicability and effectiveness of the proposed methodology, a real airport terminal example is provided. Moreover, schedule risk analysis system and risk break down structure are also developed as an essential part.

APA, Harvard, Vancouver, ISO, and other styles

44

Rowe, Michael, Ayesha Hidayat, Stuart Walter, Adam Pollard, Timothy Norris, Deborah Victor, John McGrane, and Alastair Thomson. "The use of intermittent enzalutamide dosing in the treatment of metastatic castrate-resistant prostate cancer." Journal of Clinical Oncology 38, no. 6_suppl (February 20, 2020): 81. http://dx.doi.org/10.1200/jco.2020.38.6_suppl.81.

Full text

Abstract:

81 Background: Intermittent hormone manipulation in castrate-sensitive prostate cancer can improve quality of life whilst maintaining comparable disease outcomes with continuous scheduling. Enzalutamide is effective in metastatic castrate-resistant prostate cancer (mCRPC) treatment but can have significant side-effects. We conducted a retrospective analysis of patients treated with intermittent enzalutamide compared with continuous dosing. Methods: Patients prescribed enzalutamide for mCRPC at Royal Cornwall Hospital from September 2011 to February 2018 were included. Data was collected from electronic medical records, selecting patients with at least a 1 month treatment break. Kaplan-Meier analysis of overall survival from enzalutamide start (OS), time to PSA failure (TTF) and total enzalutamide treatment time (TTT) was calculated for intermittent and continuous responders (>50% PSA drop), assigned significance level of 0.05. Results: 243 patients received enzalutamide, 110 (45%) were continuous responders and 29 (12%) had intermittent dosing. All patients treated intermittently had a PSA response prior to first treatment break, which was most commonly for fatigue (60%). 25% were still receiving enzalutamide. Median number of breaks was 1 (range 1-7), time on treatment was 70% and time to first break was 5 months. The intermittent group had significantly improved OS with median not reached, median OS for continuous responders was 19 months (HR 2.39, 95% CI 1.53-3.76, p=0.002). The intermittent group had prolonged TTF (median 13 vs 6 months, p=0.001) and TTT (median 30 vs 10 months, p=0.0003). Conclusions: Intermittent dosing of enzalutamide in these mCRPC patients does not adversely impact OS, increasing time patients remain on treatment. However, this was a small, retrospective, single-centre study; prospective trials are necessary to clarify the role of intermittent enzalutamide.[Table: see text]

APA, Harvard, Vancouver, ISO, and other styles

45

Manning, Walter H., and Shannon W. Hadley. "Predicting Articulatory Performance during Treatment Breaks." Language, Speech, and Hearing Services in Schools 18, no. 1 (January 1987): 15–22. http://dx.doi.org/10.1044/0161-1461.1801.15.

Full text

Abstract:

Auditory masking procedures have shown promise as a means of identifying children who have begun to stabilize correct phoneme production. However, these procedures typically have been employed with children who have achieved high levels of acquisition. In the present investigation 28 children with relatively low levels of phoneme acquisition (30%–80% correct) were studied. The masking procedure helped to distinguish those children who showed no change in their performance from those children who subsequently improved the accuracy of their production during a 3-week break from treatment. The results suggest that the masking procedure predicts the articulatory stability of children with relatively low levels of correct acquisition and may provide useful information for making decisions concerning scheduling and dismissal from treatment.

APA, Harvard, Vancouver, ISO, and other styles

46

Shang, Ming. "A New Hardware Isolation Architecture." Applied Mechanics and Materials 530-531 (February 2014): 631–36. http://dx.doi.org/10.4028/www.scientific.net/amm.530-531.631.

Full text

Abstract:

Virtual systems are usually attacked due to the vulnerabilities in the hypervisor. The hypervisor cannot solve this because its code size is too big to implement totally right. This paper proposed a new hardware-software architecture based on hardware isolation, which adds a new component in CPU to provide hard-level isolation. Even when the malicious code gets the highest software privilege, it cannot break into another domain from current domain. This paper also gives the implementation of the booting, memory isolation, scheduling, interrupt handling and inter-domain communication.

APA, Harvard, Vancouver, ISO, and other styles

47

Kangarloo, Nasim, Javad Rezaeian, and Xaniar Khosrawi. "Jit Scheduling Problem on Flexible Flow Shop with Machine Break Down, Machine Eligibility and Setup Times." Journal of Mathematics and Computer Science 16, no. 01 (March 30, 2016): 50–68. http://dx.doi.org/10.22436/jmcs.016.01.06.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Hasani-Goodarzi, Asefeh, Masoud Rabbani, and Neda Manavizade. "A Novel Mathematical Model for Manpower Scheduling in Break (Relief) Times in Mixed Model Assembly Lines." Procedia - Social and Behavioral Sciences 62 (October 2012): 1371–77. http://dx.doi.org/10.1016/j.sbspro.2012.09.234.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Xiao, Liyang, Mahjoub Dridi, and Amir Hajjam El Hassani. "Mathematical Model for the Home Health Care Scheduling and Routing Problem with Flexible Lunch Break Requirements." IFAC-PapersOnLine 51, no. 11 (2018): 334–39. http://dx.doi.org/10.1016/j.ifacol.2018.08.305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Shafique, Shoaib. "A Simulation Approach to Semiconductor Scheduling Problem in Micro-Lithographic Process." International Journal of New Practices in Management and Engineering 11, no. 1S (January 20, 2022): 16–17. http://dx.doi.org/10.17762/ijnpme.v11i1s.138.

Full text

Abstract:

In this write up, a scheduling issue and FDC in photolithographic process of semiconductor manufacturing are thought of. By and large, the photolithographic progression is viewed as the most significant processes since it might influence the creation profitability because of its different mechanical traits. Truly, the photolithography hardware comprises of three fundamental parts which are intended to process various sorts of items as a machine for universally useful. Be that as it may, in current semiconductor creation system, a similar kind of item is processed so as to diminish formula change time brought about by changing veils in scanner module. Also, FDC can quickly distinguish strange circumstance of activity machine, in order to improve the yield rate. Along these lines, in this examination, the multi-item creation case with various plans is considered in micro-lithographic process in regards to scheduling issue, and a FDC system is built up that comprising of fluffy deduction system and decision tree to screen and break down warming bend of delicate prepare in micro-lithographic process.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!