Relevant bibliographies by topics / Break scheduling

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic '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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Break scheduling"

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 be­tween 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
More sources

Dissertations / Theses on the topic "Break scheduling"

1

Park, Suwan. "An Optimal Pipe Replacement Scheduling Model for Water Distribution Systems." Diss., Virginia Tech, 2000. http://hdl.handle.net/10919/26171.

Full text
Abstract:
While the idea of critical break rate of water distribution pipeline (defined as the break rate after which it is no longer economical to continuously repair) has been accepted in the literature and among the practicing engineers, the formula to obtain the critical break rate has remained elusive. In this dissertation, an equation for identifying the threshold break rate of a pipe is developed. The threshold break rate equation gives a rule of thumb for pipe replacement decision. Input parameters to obtain the threshold break rate of a pipe are repair and replacement costs, interest rate, and the length of the pipe. In addition, a methodology that enables the use of threshold break rate with the failure intensity and hazard functions is developed. The methodology is drawn by considering the relationships of the definitions of the threshold break rate with intensity and hazard functions in the context of a repairable system's failure process modeling. As a result, the newly developed threshold break rate equation can be coupled with any appropriate intensity and hazard function to obtain economically optimal replacement time of a pipe. Also, practical usage of the threshold break rate is demonstrated with a number of numerical examples. Design aids in the form of charts and tables are provided. The threshold break rate can be easily obtained either graphically or with the aid of the tables. The methodology that links the threshold break rate and failure rate (intensity and hazard) functions is extended to accommodate stress multiplying environmental factors in the form of the proportional intensity and hazards model. The two models consist of an age dependent failure rate function and a covariate structure. They are applied to a case study area pipe system to obtain optimal replacement times for individual pipes in the system. As a result, important hazard characteristics of water distribution pipes are drawn, and implications on the optimal replacement analysis are discussed. A pipe break prediction model is also developed in this research. The model spans the space between the linear and exponential break trends. The model is applied to the case study area pipe system with various cost options. The results from this analysis are discussed in terms of practical implementation of the replacement strategies.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
2

Di, Pasquale Valentina. "Development of a Human Reliability Analysis (HRA) model for break scheduling management in human-intensive working activities." Doctoral thesis, Universita degli studi di Salerno, 2018. http://hdl.handle.net/10556/3112.

Full text
Abstract:
2016 - 2017
Human factors play an inevitable role in working contexts and the occurrence of human errors impacts on system reliability and safety, equipment performance and economic results. If human fallibility contributes to majority of incidents and accidents in high-risk systems, it mainly affects the quality and productivity in low-risk systems. Due to the prevalence of human error and the huge and often costly consequences, a considerable effort has been made in the field of Human Reliability Analysis (HRA), thus arriving to develop methods with the common purpose to predict the human error probability (HEP) and to enable safer and more productive designs. The purpose of each HRA method should be the HEP quantification to reduce and prevent possible conditions of error in a working context. However, existing HRA methods do not always pursue this aim in an efficient way, focusing on the qualitative error evaluation and on high-risk contexts. Moreover, several working aspects have been considered to prevent accidents and improve human performance in human-intensive working contexts, as for example the selection of adequate work-rest policies. It is well-known that introducing breaks is a key intervention to provide recovery after fatiguing physical work, prevent the growth of accident risks, and improve human reliability and productivity for individuals engaged in either mental or physical tasks. This is a very efficient approach even if it is not widely applied. ... [edited by Author]
XXX ciclo
APA, Harvard, Vancouver, ISO, and other styles
3

Sze, San Nah. "A study on multi-trip vehicle routing problem with time windows and meal break considerations." Thesis, The University of Sydney, 2011. http://hdl.handle.net/2123/7746.

Full text
Abstract:
In the manpower scheduling problem with multiple trips vehicle routing and time windows consideration, a group of staff workers has to be assigned to a number of jobs in such a way that the total number of staff required is minimised, and each job’s requirements for manpower, transportation time, and time windows must be respected. Furthermore, if several staff is requested to cooperate, they must work on the job at the same time. The problem originates from manpower scheduling for the in-flight food loading operations and could be modeled as Multiple Trips Vehicle Routing and Scheduling Problem with Time Windows and meal break considerations (MTVRSPTW-MB). In this thesis, we present a mathematical model of MTVRSPTW-MB and show that even for a reduced problem; it is intractable on this small sample size of data. Therefore, we developed an original two-stage scheduling heuristic algorithm to cope with this complicated combinatorial optimisation problem. This heuristic uses some simple laxity scheduling and priority rules to do the job assignment and scheduling in two stages. The heuristic is tested on real-life problem instances supplied by one of the in-flight caterers from Malaysia. On top of that, a pre-processing data algorithm was developed to spread the demand as evenly as possible. We obtained excellent solutions in reduction manpower in all the cases within three seconds. We also evaluated the heuristic further by comparing it with a popular heuristic insertion algorithm. The computational results report the effectiveness and robustness of our proposed heuristics. Our heuristic algorithm has also proved computational bounded.
APA, Harvard, Vancouver, ISO, and other styles
4

Yeganehtalab, Babak. "Construction Management Methods and Techniques in Army Tactical Shelter." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1609144/.

Full text
Abstract:
This thesis presents a research effort aimed at developing using construction methods and techniques in army tactical shelter. The beginning step focuses on developing and identifying different activities and work breakdown structure applicable in shelter prototype. The next step focuses on identifying resource allocation. This include allocate resources based on the delivered project as per alternative one and for the second alternative as optimization, resource allocation modified and tried to level and minimize resource peak. In addition, the cost calculated for the whole project as well as for each WBS and activities which consider as alternative one and in the second alternative, cost mitigation applied according to available resources and adjusting predecessors and successors of each activity. In conclusion, two alternatives compared, available outcome presents, and future work suggested for the project team to continue this effort.
APA, Harvard, Vancouver, ISO, and other styles
5

Erhard, Melanie Johanna Patricia [Verfasser], and Jens O. [Akademischer Betreuer] Brunner. "Essays in physician scheduling with a special focus on breaks and flexibility / Melanie Erhard ; Betreuer: Jens O. Brunner." Augsburg : Universität Augsburg, 2019. http://d-nb.info/1188564382/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Hang. "Distributed Support Vector Machine With Graphics Processing Units." ScholarWorks@UNO, 2009. http://scholarworks.uno.edu/td/991.

Full text
Abstract:
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) optimization problem. Sequential Minimal Optimization (SMO) is a decomposition-based algorithm which breaks this large QP problem into a series of smallest possible QP problems. However, it still costs O(n2) computation time. In our SVM implementation, we can do training with huge data sets in a distributed manner (by breaking the dataset into chunks, then using Message Passing Interface (MPI) to distribute each chunk to a different machine and processing SVM training within each chunk). In addition, we moved the kernel calculation part in SVM classification to a graphics processing unit (GPU) which has zero scheduling overhead to create concurrent threads. In this thesis, we will take advantage of this GPU architecture to improve the classification performance of SVM.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Break scheduling"

1

Ramli, Razamin, Haslinda Ibrahim, and Tze Shung Lim. Solving a bus driver scheduling problem: A genetic algorithm approach. UUM Press, 2013. http://dx.doi.org/10.32890/9789670474311.

Full text
Abstract:
Many transport companies face problems in regulating their transport services due to various challenges and issues. These problems affect the quality of the services provided especially in a university campus environment, where students heavily depend on the university transport services for their daily commuting.What are the problems faced by the management of the campus transport company? What are the issues raised by the drivers operating the on-campus buses?Hence, in assisting the management of the transport company the authors have identified the inefficiency of their bus driver scheduling system as one of the main problems, which needed to be tackled.For that reason, the authors developed an efficient bus driver scheduling model based on the Genetic Algorithm (GA) approach.The GA model is able to provide some resolutions and insight in relation to these inquiries: What are the constraints being considered in this bus driver scheduling problem?How were the drivers break times being distributed in this GA approach?How was the time taken to generate an efficient schedule?
APA, Harvard, Vancouver, ISO, and other styles
2

Ronen, Boaz, Joseph S. Pliskin, and Shimeon Pass. Constraint Management in a Bottleneck Environment (DRAFT). Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780190843458.003.0005.

Full text
Abstract:
This chapter introduces steps 4 through 7 of the theory of constraints—that, respectively, decide how to exploit and utilize the constraint, subordinate the system to the constraint, elevate and break the constraint, and do not let inertia become the system constraint. The chapter shows how to achieve more using the existing resources by focusing on the bottleneck. For example, reducing waste (“garbage time”) of the bottleneck can quite quickly increase the system’s throughput. The subordination of the rest of the system to the bottleneck is then discussed. For this purpose, the scheduling mechanism of drum–buffer–rope can be implemented in some areas of healthcare systems, like operating rooms, leading to increased throughput and reduction of waiting times as well as improved clinical quality.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Break scheduling"

1

Di Gaspero, Luca, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, and Wolfgang Slany. "Automated Shift Design and Break Scheduling." In Studies in Computational Intelligence, 109–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39304-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Widl, Magdalena, and Nysret Musliu. "An Improved Memetic Algorithm for Break Scheduling." In Hybrid Metaheuristics, 133–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16054-7_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meyer, Christoph Manuel. "Dispatchers' Tasks in Combined Vehicle Routing and Break Scheduling." In Vehicle Routing under Consideration of Driving and Working Hours, 25–38. Wiesbaden: Gabler, 2011. http://dx.doi.org/10.1007/978-3-8349-6732-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Meyer, Christoph Manuel, Herbert Kopfer, Adrianus Leendert Kok, and Marco Schutten. "Distributed Decision Making in Combined Vehicle Routing and Break Scheduling." In Dynamics in Logistics, 125–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-11996-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meyer, Christoph Manuel. "Distributed Decision Making in Combined Vehicle Routing and Break Scheduling." In Vehicle Routing under Consideration of Driving and Working Hours, 67–101. Wiesbaden: Gabler, 2011. http://dx.doi.org/10.1007/978-3-8349-6732-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mohaupt, Michael, and Andreas Hilbert. "Advertisement Scheduling-Revenue Management with TV Break Preference-Based Cancellations." In Operations Research Proceedings, 383–88. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-00795-3_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kopfer, Herbert, Christoph Manuel Meyer, and Hendrik Braun. "Vehicle Routing and Break Scheduling by a Distributed Decision Making Approach." In Logistics Management, 273–84. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20863-3_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lujak, Marin, and Holger Billhardt. "A Distributed Algorithm for Dynamic Break Scheduling in Emergency Service Fleets." In PRIMA 2017: Principles and Practice of Multi-Agent Systems, 477–85. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69131-2_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Meyer, Christoph Manuel. "Restricted Dynamic Programming Heuristic for the Problem of Combined Vehicle Routing and Break Scheduling." In Vehicle Routing under Consideration of Driving and Working Hours, 103–33. Wiesbaden: Gabler, 2011. http://dx.doi.org/10.1007/978-3-8349-6732-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Régin, Jean-Charles. "Minimization of the number of breaks in sports scheduling problems using constraint programming." In Constraint Programming and Large Scale Discrete Optimization, 115–30. Providence, Rhode Island: American Mathematical Society, 2001. http://dx.doi.org/10.1090/dimacs/057/07.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Break scheduling"

1

Loganathan, G. V., S. Park, N. Agbenowosi, and H. D. Sherali. "A Threshold Break Rate for Scheduling Optimal Pipeline Replacement." In World Water and Environmental Resources Congress 2001. Reston, VA: American Society of Civil Engineers, 2001. http://dx.doi.org/10.1061/40569(2001)407.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lucanin, Draen, and Ivona Brandic. "Take a Break: Cloud Scheduling Optimized for Real-Time Electricity Pricing." In 2013 International Conference on Cloud and Green Computing (CGC). IEEE, 2013. http://dx.doi.org/10.1109/cgc.2013.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kletzander, Lucas, Tommaso Mannelli Mazzoli, and Nysret Musliu. "Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints." In GECCO '22: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3512290.3528876.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jiang, Zhengqian, Sean Psulkowski, Arriana Nwodu, Hui Wang, and Tarik Dickens. "Improved Co-Scheduling of Printing Path Scanning for Collaborative Additive Manufacturing." In ASME 2019 14th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/msec2019-3005.

Full text
Abstract:
Abstract Additive manufacturing processes, especially those based on fused filament fabrication (FFF) mechanism, have relatively low productivity and suffer from production scalability issue. One solution is to adopt a collaborative additive manufacturing system that is equipped with multiple extruders working simultaneously to improve productivity. The collaborative additive manufacturing encounters a grand challenge in the scheduling of printing path scanning by different extruders. If not properly scheduled, the extruders may collide into each other or the structures built by earlier scheduled scanning tasks. However, there existed limited research addressing this problem, in particular, lacking the determination of the scanning direction and the scheduling for sub-path scanning. This paper deals with the challenges by developing an improved method to optimally break the existing printing paths into sub-paths and assign these generated sub-paths to different extruders to obtain the lowest possible makespan. A mathematical model is formulated to characterize the problem, and a hybrid algorithm based on an evolutionary algorithm and a heuristic approach is proposed to determine the optimal solutions. The case study has demonstrated the application of the algorithms and compared the results with the existing research. It has been found that the printing time can be reduced by as much as 41.3% based on the available hardware settings.
APA, Harvard, Vancouver, ISO, and other styles
5

Gupta, Deepak, and Poojadeep Sehgal. "Effect of Break–Down Interval with Weightage of Jobs for Minimizing Hiring Cost in 2-Stage Flow-Shop Scheduling." In 2021 IEEE International Conference on Technology, Research, and Innovation for Betterment of Society (TRIBES). IEEE, 2021. http://dx.doi.org/10.1109/tribes52498.2021.9751625.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goossens, Dries, and Frits C. R. Spieksma. "Sports scheduling with generalized breaks." In 2011 IEEE Symposium on Computational Intelligence In Scheduling (SCIS) - Part Of 17273 - 2011 Ssci. IEEE, 2011. http://dx.doi.org/10.1109/scis.2011.5976546.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lovett, Alexander H., C. Tyler Dick, Conrad Ruppert, M. Rapik Saat, and Christopher Barkan. "Development of an Integrated Model for the Evaluation and Planning of Railroad Track Maintenance." In 2013 Joint Rail Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/jrc2013-2407.

Full text
Abstract:
In order for a railroad to function effectively all aspects of the system should be maintained in good working order. Locomotives and rolling stock regularly move through areas where they can be inspected and maintained. However track does not move, so inspectors must traverse the line either on foot or in a rail mounted vehicle and maintenance crews must be sent to specific locations to make track repairs, which may not always happen before a service disruption. A track failure, due to either exceeding some industry or governmental specification or an acute failure, such as a rail break, can result in costly delays or even derailments with significant consequences. To help avoid such failures, it is beneficial for a railroad to be able to predict when and where failures might occur and then evaluate the relative costs and benefits of performing maintenance activities to ensure that the most cost effective actions are taken. A model is being developed to assist in the process of scheduling and directing track maintenance work. The model consists of three primary modules: an integrated track quality and degradation module, a maintenance activity selection module, and a scheduling optimization module. By taking into account a wide range of costs and benefits, the model can help railroad infrastructure managers better account for risk and indirect costs such as track time, as well as account for the criticality of certain types of imminent failures. This paper will describe the inputs and outputs for the model, as well as detailing the concepts associated with each of the model components.
APA, Harvard, Vancouver, ISO, and other styles
8

Ioan, Cioara, and Lucica Cioara. "METHOD AND COMPUTER-ASSISTED PROGRAM FOR FORECASTING PRELUCRABILITY YARNS IN THE WEAVING." In eLSE 2013. Carol I National Defence University Publishing House, 2013. http://dx.doi.org/10.12753/2066-026x-13-273.

Full text
Abstract:
Weaving process efficiency is influenced by several factors including a significant proportion have characteristics of processed yarns. In the current period, the acquisition of new weaving machines are very expensive investment, it is necessary to predict processing yarns for decisions rejecting inappropriate lots of yarns to be done before placing on technological flow. In this way it creates the premises forecasting difficulties in the production process (efficiency, quality indicators) as well as proper scheduling timely completion of orders various beneficiaries. This paper presents a method of forecasting foundation and processing of warp and weft threads on unconventional projectile weaving machines. Prelucrability is appreciated on physical and mechanical properties of the yarns purchased, properties that are included in bulletins or quality standards and product standards. It aims at estimating the number of breaks of warp threads and the number of weft yarn breaks in the weaving of a meter of fabric. The number of breaks is significantly influenced by deficiencies of quality yarns, the yarns tensioning system on the weaving machine and the variation of tensile strength / tensile yarns (coefficient of variation). Method exposed in the paper is focused on mathematical modeling of specific phenomena and the weaving process using a suitable computer program, computer-based simulation that allows multiple threads specified characteristics and provides scientifically elements weaving technology forecasting their prelucrability. Elements provided by computer-aided design software allows analysis, interpretation and proper adoption of the optimal solution for a given situation so that decision rejecting inappropriate lots of yarns to be done before placing on technological flow.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Break scheduling' for particular source types:
Journal articles
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!

To the bibliography