Academic literature on the topic 'The schedule optimization'

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 'The schedule optimization.'

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 "The schedule optimization"

1

Berg, Bjorn P., S. Ayca Erdogan, Jennifer Mason Lobo, and Kathryn Pendleton. "A Method for Balancing Provider Schedules in Outpatient Specialty Clinics." MDM Policy & Practice 5, no. 2 (2020): 238146832096306. http://dx.doi.org/10.1177/2381468320963063.

Full text
Abstract:
Background. Variability in outpatient specialty clinic schedules contributes to numerous adverse effects including chaotic clinic settings, provider burnout, increased patient waiting times, and inefficient use of resources. This research measures the benefit of balancing provider schedules in an outpatient specialty clinic. Design. We developed a constrained optimization model to minimize the variability in provider schedules in an outpatient specialty clinic. Schedule variability was defined as the variance in the number of providers scheduled for clinic during each hour the clinic is open. We compared the variance in the number of providers scheduled per hour resulting from the constrained optimization schedule with the actual schedule for three reference scenarios used in practice at M Health Fairview’s Clinics and Surgery Center as a case study. Results. Compared to the actual schedules, use of constrained optimization modeling reduced the variance in the number of providers scheduled per hour by 92% (1.70–0.14), 88% (1.98–0.24), and 94% (1.98–0.12). When compared with the reference scenarios, the total, and per provider, assigned clinic hours remained the same. Use of constrained optimization modeling also reduced the maximum number of providers scheduled during each of the actual schedules for each of the reference scenarios. The constrained optimization schedules utilized 100% of the available clinic time compared to the reference scenario schedules where providers were scheduled during 87%, 92%, and 82% of the open clinic time, respectively. Limitations. The scheduling model’s use requires a centralized provider scheduling process in the clinic. Conclusions. Constrained optimization can help balance provider schedules in outpatient specialty clinics, thereby reducing the risk of negative effects associated with highly variable clinic settings.
APA, Harvard, Vancouver, ISO, and other styles
2

Albogamy, Fahad R. "Optimal Energy Consumption Scheduler Considering Real-Time Pricing Scheme for Energy Optimization in Smart Microgrid." Energies 15, no. 21 (2022): 8015. http://dx.doi.org/10.3390/en15218015.

Full text
Abstract:
Energy consumption schedulers have been widely adopted for energy management in smart microgrids. Energy management aims to alleviate energy expenses and peak-to-average ratio (PAR) without compromising user comfort. This work proposes an energy consumption scheduler using heuristic optimization algorithms: Binary Particle Swarm Optimization (BPSO), Wind Driven Optimization (WDO), Genetic Algorithm (GA), Differential Evolution (DE), and Enhanced DE (EDE). The energy consumption scheduler based on these algorithms under a price-based demand response program creates a schedule of home appliances. Based on the energy consumption behavior, appliances within the home are classified as interruptible, noninterruptible, and hybrid loads, considered as scenario-I, scenario-II, and scenario-III, respectively. The developed model based on optimization algorithms is the more appropriate solution to achieve the desired objectives. Simulation results show that the expense and PAR of schedule power usage in each scenario are less compared to the without-scheduling case.
APA, Harvard, Vancouver, ISO, and other styles
3

Schrage, Rico, Paul Hendrik Tiemann, and Astrid Niesse. "A Multi-Criteria Metaheuristic Algorithm for Distributed Optimization of Electric Energy Storage." ACM SIGEnergy Energy Informatics Review 2, no. 4 (2022): 44–59. http://dx.doi.org/10.1145/3584024.3584029.

Full text
Abstract:
The distributed schedule optimization of energy storage constitutes a challenge. Such algorithms often expect an input set containing all feasible schedules and, therefore, require searching the schedule space efficiently. However, it is hardly possible to accomplish this with energy storage due to its high flexibility. In this paper, the problem is introduced in detail and addressed by a metaheuristic algorithm, which generates a preselection of schedules. Two contributions are presented to achieve this goal: First, an extension for a distributed schedule optimization allowing a simultaneous optimization is developed. Second, an evolutionary algorithm is designed to generate optimized schedules with respect to multiple criteria. It is shown that the presented approach is suitable to schedule electric energy storage in actual households and industries with different generator and storage types.
APA, Harvard, Vancouver, ISO, and other styles
4

Saber, A. Y., Wahed Newaz, and A. K. M. Zaidi Sattar. "Generator Scheduling (a Combinatorial Optimization Problem) by Annealing Method." DIU Journal of Science & Technology 2, no. 1 (2024): 72–80. https://doi.org/10.5281/zenodo.13674845.

Full text
Abstract:
Generator scheduling is acombinatorial optimization problem and thispaper presents a new version of annealing (SA)method to model and solve the schedulingproblem. Firstly, solution is decomposed intohourly schedules and each hourly schedule ismodified by decomposed-SA using bits flipping. Ifthe generated new hourly schedule is better, byconvention it is accepted deterministically. Aworse hourly schedule is accepted withtemperature dependent SA probability. A newsolution consists of these hourly schedules ofentire scheduling period after repair as unit-wiseconstraints may not be fulfilled at the time ofindividual hourly schedule modification. Thishelps to direct and modify schedules ofappropriate hours. Secondly, this new solution isaccepted for the next iteration if its cost is lessthan that of current solution. A higher cost newsolution is accepted with temperature dependentSA probability again. Besides, problem dependentother features are incorporated to save theexecution time. The proposed method is testedusing the reported problem data sets. Simulationresults are compared to previous reported results.Numerical results show an improvement insolution cost and time compared to the resultsobtained from powerful algorithms.Keywords: Simulated annealing, dec
APA, Harvard, Vancouver, ISO, and other styles
5

Guo, Fengdi, Jeremy Gregory, and Randolph Kirchain. "Probabilistic Life-Cycle Cost Analysis of Pavements Based on Simulation Optimization." Transportation Research Record: Journal of the Transportation Research Board 2673, no. 5 (2019): 389–96. http://dx.doi.org/10.1177/0361198119838984.

Full text
Abstract:
Life-cycle cost analysis (LCCA) is a way to evaluate the long-term cost effectiveness of different pavement designs or treatment actions. Owing to the existence of uncertainties, many probabilistic LCCA models have been proposed. They mainly use a prescribed treatment schedule or determine schedules by mechanistic-empirical analysis, potentially leading to the overestimation of life-cycle cost (LCC). In this paper, a new probabilistic simulation-optimization LCCA model is proposed. This new model determines treatment schedules by minimizing total LCC, including agency and user cost, which is different from current probabilistic models. In addition, it also incorporates uncertainties of treatment costs and deterioration processes. Two case studies are presented. The first one shows the influence of treatment schedule uncertainties on LCC distributions. After considering treatment schedule uncertainties, a tighter LCC distribution is estimated. The second case study compares the new model and a conventional prescribed-schedule model from the perspective of pavement design selection. The results show that the simulation-optimization model could lead to different preferred pavement designs than the prescribed-schedule model.
APA, Harvard, Vancouver, ISO, and other styles
6

Hao, Wang, Xiaobo Zhang, Baokuo Li, Zhanxue Wang, and Dawei Li. "A Combined Optimization Method for the Transition Control Schedules of Aero-Engines." Aerospace 12, no. 2 (2025): 144. https://doi.org/10.3390/aerospace12020144.

Full text
Abstract:
A well designed transition control schedule can enable the engine to quickly and smoothly transition from one operating state to another, thereby enhancing the maneuverability of the aircraft. Although traditional pointwise optimization methods are fast in solving the transition control schedules, their optimized control schedules suffer from fluctuation problems. While global optimization methods can suppress fluctuation problems, their slow solving speed makes them unsuitable for engineering applications. In this paper, a combined optimization method for the transition control schedules of aero-engines is proposed. This method divided the optimization of the control schedules into two layers. In the outer-layer optimization, the global optimization technique was utilized to suppress the fluctuation of geometrically adjustable parameters. In the inner-layer optimization, the pointwise optimization technique was adopted to quickly obtain the control schedule of fuel flow rate. Moreover, a construction method of non-uniform control points in the global optimization layer was proposed, which significantly reduced the number of control points that needed to be optimized; thus, improving the efficiency of global optimization. The optimization problem of the acceleration and deceleration control schedules of a mixed-flow turbofan engine was used to verify the effectiveness of the combined optimization method. The results show that, compared with the pointwise optimization method, the transition time optimized by the combined optimization method shows no obvious difference. The control schedules optimized by the combined optimization method are not only smooth but can also prevent some components from approaching their working boundaries.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhao, Mengqi, Xiaoling Wang, Jia Yu, Lei Bi, Yao Xiao, and Jun Zhang. "Optimization of Construction Duration and Schedule Robustness Based on Hybrid Grey Wolf Optimizer with Sine Cosine Algorithm." Energies 13, no. 1 (2020): 215. http://dx.doi.org/10.3390/en13010215.

Full text
Abstract:
Construction duration and schedule robustness are of great importance to ensure efficient construction. However, the current literature has neglected the importance of schedule robustness. Relatively little attention has been paid to schedule robustness via deviation of an activity’s starting time, which does not consider schedule robustness via structural deviation caused by the logical relationships among activities. This leads to a possibility of deviation between the planned schedule and the actual situation. Thus, an optimization model of construction duration and schedule robustness is proposed to solve this problem. Firstly, duration and two robustness criteria including starting time deviation and structural deviation were selected as the optimization objectives. Secondly, critical chain method and starting time criticality (STC) method were adopted to allocate buffers to the schedule in order to generate alternative schedules for optimization. Thirdly, hybrid grey wolf optimizer with sine cosine algorithm (HGWOSCA) was proposed to solve the optimization model. The movement directions and speed of grey wolf optimizer (GWO) was improved by sine cosine algorithm (SCA) so that the algorithm’s performance of convergence, diversity, accuracy, and distribution improved. Finally, an underground power station in China was used for a case study, by which the applicability and advantages of the proposed model were proved.
APA, Harvard, Vancouver, ISO, and other styles
8

Tao, Mei, Lan Ma, and Yiming Ma. "Flight schedule adjustment for hub airports using multi-objective optimization." Journal of Intelligent Systems 30, no. 1 (2021): 931–46. http://dx.doi.org/10.1515/jisys-2020-0114.

Full text
Abstract:
Abstract Based on the concept of “passengers self-help hubbing,” we build a flight schedule optimization model where maximizing the number of feasible flight connections, indicating transfer opportunities, as one objective and minimizing total slot displacements as the other objective. At the same time, the “Demand Smoothing Model” is introduced into the flight schedule optimization model to reduce the queuing delays for arrival and departure flights. We take into account all aircraft itineraries, the difficulty level of schedule coordination, and the maximum displacement of any single flight acceptable to airlines when optimizing flight schedule. Given an original schedule, the model produces a feasible modified schedule that obeys the slot limits specified for an airport without canceling any flights, increases transfer opportunities, and improves on-time performance for hub airports while reducing interference with airline scheduling preferences. The model was verified with the operating data of the Urumqi international airport, and the results show that minor adjustments to flight schedules can increase the transfer opportunities of the airport and significantly reduce flight queuing delays.
APA, Harvard, Vancouver, ISO, and other styles
9

Yu, Jingyi, Minghua Hu, Zheng Zhao, and Bin Jiang. "Flight Schedule Optimization Considering Fine-Grained Configuration of Slot Coordination Parameters." Aerospace 11, no. 9 (2024): 763. http://dx.doi.org/10.3390/aerospace11090763.

Full text
Abstract:
In response to the rapid growth of air passenger and cargo transportation services and the sharp increase in congestion at various airports, it is necessary to optimize the allocation of flight schedules. On the basis of reducing the total airport delay time and ensuring the total deviation of flight schedules applied by airlines, it is necessary to consider finely configuring flight schedules with slot coordination parameters, introducing a 5 min slot coordination parameter, and optimizing airport flight schedules in different time periods. This article considers factors such as flight schedule uniqueness, corridor flow restrictions, and time adjustment range limitations to establish a three-objective flight-schedule refinement configuration model, which is solved using the NSGA-II algorithm based on the entropy weight method. Taking Beijing Capital International Airport as an example, the optimized results show that the total flight delay was reduced from 4130 min to 1142 min, and the original delay of 389 flights was reduced to 283 flights. Therefore, flight schedule optimization considering the fine-grained configuration of slot coordination parameters can effectively reduce airport delays, fully utilize time resources, and reduce waste of time slot resources.
APA, Harvard, Vancouver, ISO, and other styles
10

Su, Ruiye, Leishan Zhou, and Jinjin Tang. "Locomotive Schedule Optimization for Da-qin Heavy Haul Railway." Mathematical Problems in Engineering 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/607376.

Full text
Abstract:
The main difference between locomotive schedule of heavy haul railways and that of regular rail transportation is the number of locomotives utilized for one train. One heavy-loaded train usually has more than one locomotive, but a regular train only has one. This paper develops an optimization model for the multilocomotive scheduling problem (MLSP) through analyzing the current locomotive schedule of Da-qin Railway. The objective function of our paper is to minimize the total number of utilized locomotives. The MLSP is nondeterministic polynomial (NP) hard. Therefore, we convert the multilocomotive traction problem into a single-locomotive traction problem. Then, the single-locomotive traction problem (SLTP) can be converted into an assignment problem. The Hungarian algorithm is applied to solve the model and obtain the optimal locomotive schedule. We use the variance of detention time of locomotives at stations to evaluate the stability of locomotive schedule. In order to evaluate the effectiveness of the proposed optimization model, case studies for 20 kt and 30 kt heavy-loaded combined trains on Da-qin Railway are both conducted. Compared to the current schedules, the optimal schedules from the proposed models can save 62 and 47 locomotives for 20 kt and 30 kt heavy-loaded combined trains, respectively. Therefore, the effectiveness of the proposed model and its solution algorithm are both valid.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "The schedule optimization"

1

Lindner, Thomas. "Train schedule optimization in public rail transport." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=95980479X.

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

Wilcox, Ronald James. "Flexible schedule optimization for human-robot collaboration." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/81713.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 99-101).<br>Robots are increasingly entering domains typically thought of as human-only. This convergence of human and robotic agents leads to a need for new technology to enable safe and efficient collaboration. The goal of this thesis is to develop a task allocation and scheduling algorithm for teams of robots working with or around teams of humans in intense domains where tight, fluid choreography of robotic schedules is required to guarantee the safety of all involved while maintaining high levels of productivity. Three algorithms are presented in this work: the Adaptive Preferences Algorithm, the Multi-Agent Optimization Algorithm, and Tercio. Tercio, the culminatory algorithm, is capable of assigning robots to tasks and producing near-optimal schedules for ten agents and hundreds of tasks in seconds while making guarantees about process specifications such as worker safety and deadline satisfaction. This work extends dynamic scheduling methods to incorporate flexible windows with an optimization framework featuring a mixed integer program and a satisficing hueristic scheduler. By making use of Tercio, a manufacturing facility or other high-intensity domain may fluidly command a team of robots to complete tasks in a quick, efficient manner while maintaining an ability to respond seamlessly to disturbances at execution. This greatly increases both productivity, by decreasing the time spent recompiling solutions, and responsiveness to humans in the area. These improvements in performance are displayed with multiple live demonstrations and simulations of teams of robots responding to disturbances. Tercio acts as an enabling step towards the ultimate goal of fully coordinated factories of dozens to hundreds of robots accomplishing many thousands of tasks in a safe, predictable, efficient manner.<br>by Ronald J. Wilcox.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
3

Shenoi, Rajesh Gopalakrishna. "Integrated airline schedule optimization : models and solution methods." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/10655.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1996.<br>Includes bibliographical references (p. 133-148).<br>by Rajesh Gopalakrishna Shenoi.<br>Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
4

Yuan, Duojia, and S3024047@student rmit edu au. "Flight Delay-Cost Simulation Analysis and Airline Schedule Optimization." RMIT University. Aerospace, Mechanical, Manufacturing Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080618.092923.

Full text
Abstract:
In order to meet the fast-growing demand, airlines have applied much more compact air-fleet operation schedules which directly lead to airport congestion. One result is the flight delay, which appears more frequently and seriously; the flight delay can also significantly damage airline's profitability and reputation The aim of this project is to enhance the dispatch reliability of Australian X Airline's fleet through a newly developed approach to reliability modeling, which employs computer-aided numerical simulation of the departure delay distribution and related cost to achieve the flight schedule optimization. The reliability modeling approach developed in this project is based on the probability distributions and Monte Carlo Simulation (MCS) techniques. Initial (type I) delay and propagated (type II) delay are adopted as the criterion for data classification and analysis. The randomicity of type I delay occurrence and the internal relationship between type II delay and changed flight schedule are considered as the core factors in this new approach of reliability modeling, which compared to the conventional assessment methodologies, is proved to be more accurate on the departure delay and cost evaluation modeling. The Flight Delay and Cost Simulation Program (FDCSP) has been developed (Visual Basic 6.0) to perform the complicated numerical calculations through significant amount of pseudo-samples. FDCSP is also designed to provide convenience for varied applications in dispatch reliability modeling. The end-users can be airlines, airports and aviation authorities, etc. As a result, through this project, a 16.87% reduction in departure delay is estimated to be achieved by Australian X Airline. The air-fleet dispatch reliability has been enhanced to a higher level - 78.94% compared to initial 65.25%. Thus, 13.35% of system cost can be saved. At last, this project also achieves to set a more practical guideline for air-fleet database and management upon overall dispatch reliability optimization.
APA, Harvard, Vancouver, ISO, and other styles
5

Agbokou, Claudine Biova 1979. "Robust airline schedule planning : review and development of optimization approaches." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/30143.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering; and, (S.M.)--Massachusetts Institute of Technology, Operations Research Center, 2004.<br>Includes bibliographical references (p. 87-89).<br>Major airlines aim to generate schedules that maximize profit potential and satisfy constraints involving flight schedule design, fleet assignment, aircraft maintenance routing and crew scheduling. Almost all aircraft and crew schedule optimization models assume that flights, aircraft, crews, and passengers operate as planned. Thus, airlines typically construct plans that maximize revenue or minimize cost based on the assumption that every flight departs and arrives as planned. Because flight delays and cancellations result from numerous causes, including severe weather conditions, unexpected aircraft and crew failures, and congestion at the airport and in the airspace, this deterministic, optimistic scenario rarely, if ever, occurs. In fact, schedule plans are frequently disrupted and airlines often incur significant costs in addition to those originally planned. To address this issue, an approach is to design schedules that are robust to schedule disruptions and attempt to minimize realized, and not planned, costs. In this research, we review recovery approaches and robustness criteria in the context of airline schedule planning. We suggest new approaches for designing fleet assignments that facilitate recovery operations, and we present models to generate plans that allow for more robust crew operations, based on the idea of critical crew connections. We also examine the impact on robustness of new scheduling practices to debank hub airports.<br>by Claudine Biova Agbokou.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
6

McIntire, Seth (Seth Cullen). "Modeling drug substance purification manufacturing through schedule optimization and simulation." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/111489.

Full text
Abstract:
Thesis: M.B.A., Massachusetts Institute of Technology, Sloan School of Management, in conjunction with the Leaders for Global Operations Program at MIT, 2017.<br>Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, in conjunction with the Leaders for Global Operations Program at MIT, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 35-36).<br>This thesis develops a method by which overtime could be reduced in a highly variable drug substance purification manufacturing environment. Purification production overtime (20%) is a big cost driver at Building XX1 (BXX). Current production planning and labor resource evaluation methods at BXX Purification are manual, do not capture schedule delays, and do not adequately account for labor availability. Because of this, BXX is unable to accurately evaluate to what extent labor resource contributes to bottlenecking or how to improve overtime. A tool is devised in the Virtually Exhaustive Combinatorial System (VirtECS®) Scheduler software whereby purification production schedules are modeled and optimized. The model simulates production delays and the flow of production. Results lead to a more accurate understanding of how labor resource constrains the lot cycle time and where improvements in shift structure could be made to improve lot cycle time and variability of lot cycle time. The purification production schedules of two monoclonal antibodies (mAb) were modeled with the use of VirtECS® Scheduler. These two drug substances are selected to reflect the majority of BXX's mAb pipeline. The plant, BXX, produces a high mix of clinical and commercial launch drug substances, and is subject to a number of stochastic scheduling delays. Excel® is used to generate random sets of process times to simulate delays. These process times are fed into VirtECS®, a production schedule optimization tool, which then produces a simulated set of production schedules. Scheduling decisions of shift labor allocation and when manufacturing should start production during the week are simulated using the model. Results from this evaluation illustrate opportunities for BXX to improve overtime. Lot cycle time is found to be reduced by up to 5.9% based on model results by moving the start of production towards the end of the week and allocating more resources to the third shift from second shift. Additionally, cycle time variability, could be reduced by up to 22%. The model makes a number of assumptions which simplify purification operations whose effect should be further investigated. Future improvements for VirtECS® are proposed to better model BXX processes.<br>by Seth McIntire.<br>M.B.A.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Brändström, Johan. "Optimization for Train Energy Performance." Thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-237844.

Full text
Abstract:
In many studies efforts are made to decrease the energy consumption of trains by optimizing their drive style, e.g. accelerate and brake optimally and regenerate electricity when braking. In other studies the goal is to distribute the run time between stations in an optimal way to decrease the energy consumption, given a relatively simple drive style. In this report the goal is to combine these two energy saving methods to obtain as low energy consumption as possible. By coupling one software containing a drive style optimizer with another software which by different optimization methods calculates the optimal run time distribution on a given track this is accomplished. The study also contains a comparison between drive styles, with the goal to find a relatively simple but energy efficient drive style. Finally the dependence between run time distribution and energy consumption is further analysed. The results show that by redistributing the run times the energy consumption can be decreased compared to previously existing time tables. They also show that a relatively simple drive style gives comparable energy consumption compared to the one obtained using a drive style optimizer. Finally the results show that the dependence between run time and energy consumption can be approximated with a simple second order equation.
APA, Harvard, Vancouver, ISO, and other styles
8

Husni, Mohammed Hamza. "A multiperiod optimization model to schedule large-scale petroleum development projects." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-3218.

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

Cobanov, Branislav. "Stochastic control of animal diets optimal sampling schedule and diet optimization /." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1155661130.

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

Yao, Enxin. "Optimization of energy consumption schedule of residential loads and electric vehicles." Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/58302.

Full text
Abstract:
In the current electrical grid, utility companies have begun to use demand side management (DSM) programs and time-of-use (TOU) pricing schemes to shape the residential load profile. However, it is difficult for the residential users to respond to the pricing signal and manually manage the operation of various household appliances. Hence, the autonomous energy consumption scheduling of residential loads and electric vehicles (EVs) is necessary for the users to benefit from the DSM programs. In this thesis, we propose different algorithms to schedule the energy consumption of residential loads and EVs, and provide ancillary services to the electrical grid. First, we study the DSM for areas with high photovoltaic (PV) penetration. Since many rooftop PV units can be integrated in the distribution network, the voltage rise issue occurs when the reverse power flow from the households to the substation is significant. We use stochastic programming to formulate an energy consumption scheduling problem, which takes into account the voltage rise issue and the uncertainty of the power generation from PV units. We propose an algorithm by solving the formulated problem and jointly shave the peak load and reduce the reverse power flow. Subsequently, we study using the EVs to provide the frequency regulation service. We formulate a problem to schedule the hourly regulation capacity of the EVs using the probabilistic robust optimization framework. Our formulation takes into account the limited battery capacity of the EVs and the uncertainty of the automatic generation control (AGC) signal. An efficient algorithm is proposed to solve the formulated problem based on duality. Last but not least, we study the market participation of an aggregator which coordinates a fleet of EVs to provide frequency regulation service to an independent system operator (ISO). The two-settlement market system (i.e., the day-ahead market (DAM) and real-time market) is considered. We analyze two types of DAMs based on the market rules of New York ISO and California ISO. We formulate a problem to determine the bid for the aggregator in the DAM using stochastic program and conditional value at risk. Efficient algorithms are proposed to tackle the formulated problem.<br>Applied Science, Faculty of<br>Electrical and Computer Engineering, Department of<br>Graduate
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "The schedule optimization"

1

E, Salassi Michael. Maximizing economic returns from sugarcane production through optimization of harvest schedule. Louisiana Agricultural Experiment Station, LSU Agricultural Center, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Beck, John Christopher. A schema for constraint relaxation with instantiations for partial constraint satisfaction and schedule optimization. University of Toronto, Dept. of Computer Science, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Beck, John Christopher. A schema for constraint relaxation with instantiations for partial constraints partial constraint satisfaction and schedule optimization. National Library of Canada, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Powell, Robert David. Code optimization and hierarchical scheduling techniques for implementing the Commander Patrol Wing Ten, Moffett Field, California (COMPATWING TEN) training schedule on microcomputers. Naval Postgraduate School, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bulgakova, Irina, Yuliya Vertakova, Ol'ga Medvedeva, Sergey Medvedev, and Galina Chernyshova. Models and methods of system analysis in operations research. INFRA-M Academic Publishing LLC., 2024. https://doi.org/10.12737/2049708.

Full text
Abstract:
The textbook discusses models and methods of operations research as applied methods for the study of socio-economic processes and phenomena. These methods include those that use the apparatus of mathematical programming, schedule theory, inventory management theory, game theory, etc. The authors consider general issues of system modeling, cite the mathematical apparatus of operations research (linear programming, simplex method, integer linear programming, network models, game theory, etc.), show the areas of practical application of methods of operations research using illustrative examples. The main theoretical material is accompanied by tasks for independent work, which contributes to a faster and deeper study of problem solving methods. Meets the requirements of the federal state educational standards of higher education of the latest generation. It is intended for students studying in the fields of "Applied Mathematics and Computer Science", "Business Informatics", "Management", "Economics", whose curricula include the disciplines "Game Theory and Operations Research", "Models and methods of discrete optimization", "Methods and models in Economics", "System analysis", "Planning and optimization of computing processes". The textbook will also be useful for graduate students, researchers of departments of economics and management, specialists involved in the analysis and modeling of the development of economic and social facilities.
APA, Harvard, Vancouver, ISO, and other styles
6

Park, Byungkyu. Investigation of schedules for traffic signal timing optimization. Virginia Transportation Research Council, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

D, Green Robert, Reed David M, and United States. National Aeronautics and Space Administration., eds. RSM 1.0 user's guide: A resupply scheduler using integer optimization. National Aeronautics and Space Administration, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

D, Green Robert, Reed David M, and United States. National Aeronautics and Space Administration., eds. RSM 1.0 user's guide: A resupply scheduler using integer optimization. National Aeronautics and Space Administration, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Parsell, Doug. The optimization of glass-ceramic heat treatment schedules. 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cho, Jungsik. Optimization of long-term consumer magazine advertising media schedules. 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "The schedule optimization"

1

You, Greg Guanlin. "Production Schedule Optimization." In Mining Project Value Optimization. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-7883-6_7.

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

Battiti, Roberto, Franco Mascia, and Mauro Brunato. "Reacting on the Annealing Schedule." In Reactive Search and Intelligent Optimization. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-09624-7_3.

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

Amin, Mahmoud, Athnasious Ghaly, Fredy Ayad, and Ossama Hosny. "Overall Schedule OPTIMIZATION USING GENETIC ALGORITHMS." In Lecture Notes in Civil Engineering. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-35471-7_33.

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

Sotskov, Yuri N., Vyacheslav S. Tanaev, and Frank Werner. "Stability Radius of an Optimal Schedule: A Survey and Recent Developments." In Applied Optimization. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4757-2876-7_4.

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

Touati, Sid, and Benoit Dupont de Dinechin. "The Register Need of a Fixed Instruction Schedule." In Advanced Backend Code Optimization. John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118625446.ch7.

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

Thomson, Sarah L., and Gabriela Ochoa. "The Local Optima Level in Chemotherapy Schedule Optimisation." In Evolutionary Computation in Combinatorial Optimization. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43680-3_13.

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

Basak, Sanchita, Fangzhou Sun, Saptarshi Sengupta, and Abhishek Dubey. "Data-Driven Optimization of Public Transit Schedule." In Big Data Analytics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-37188-3_16.

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

Zu, Binghui, and Xiang Liu. "Construction Schedule Optimization Based on Genetic Algorithm." In Advances in Computer Science Research. Atlantis Press International BV, 2024. http://dx.doi.org/10.2991/978-94-6463-447-1_15.

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

Zimmermann, U. T., and T. Lindner. "Train Schedule Optimization in Public Rail Transport." In Mathematics — Key Technology for the Future. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55753-8_53.

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

Brinksma, Ed, and Angelika Mader. "Verification and Optimization of a PLC Control Schedule." In SPIN Model Checking and Software Verification. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10722468_5.

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

Conference papers on the topic "The schedule optimization"

1

Su, Rui, and Joey S. Aviles. "Research on construction schedule optimization model based on particle swarm optimization algorithm." In 2024 8th International Conference on Electrical, Mechanical and Computer Engineering (ICEMCE). IEEE, 2024. https://doi.org/10.1109/icemce64157.2024.10862719.

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

You, Young, and Sung Jung. "Optimal Active Twist Deployment Schedule of a Rotor for Performance Improvement and Vibration Reduction." In Vertical Flight Society 72nd Annual Forum & Technology Display. The Vertical Flight Society, 2016. http://dx.doi.org/10.4050/f-0072-2016-11444.

Full text
Abstract:
In this paper, the best actuation schedules exploiting various waveform types are sought taking advantage of the global search algorithm for the reduction of the power required and/or hub vibration of a rotor in high speed forward flight. The active twist schedules include two non-harmonic inputs formed based on segmented step functions along with the simple harmonic waveform input. An advanced particle swarm assisted genetic algorithm (PSGA) is employed for the optimizer. A rotorcraft computational structural dynamics (CSD) code CAMRAD II is used to perform the rotor aeromechanics analysis. A CFD/CSD coupling is introduced to assist the observations made using the CSD analysis. The PSGA optimization results are verified against the parameter sweep study performed by the harmonic actuation. The best optimum twist schedules according to the performance or vibration reduction strategy are identified and their optimization gains are compared between the actuation cases. A two-phase non-harmonic actuation schedule demonstrates the best outcome in decreasing the rotor power required while a four-phase non-harmonic schedule leads to the best vibration reduction. The mechanism of reduction gains is identified illustrating the section airloads, angle-of-attack distribution, and net elastic twist deformation predicted using CSD and CFD/CSD approaches.
APA, Harvard, Vancouver, ISO, and other styles
3

Janardanan, Aatmaj, Deepa Rajendran, and Varun Menon Nallur. "Optimization of Transportation Schedule." In 2018 International Conference on Emerging Trends and Innovations In Engineering And Technological Research (ICETIETR). IEEE, 2018. http://dx.doi.org/10.1109/icetietr.2018.8529026.

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

Klaška, David, Antonín Kučera, Vít Musil, and Vojtěch Řehák. "Mean Payoff Optimization for Systems of Periodic Service and Maintenance." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/598.

Full text
Abstract:
Consider oriented graph nodes requiring periodic visits by a service agent. The agent moves among the nodes and receives a payoff for each completed service task, depending on the time elapsed since the previous visit to a node. We consider the problem of finding a suitable schedule for the agent to maximize its long-run average payoff per time unit. We show that the problem of constructing an epsilon-optimal schedule is PSPACE-hard for every fixed non-negative epsilon, and that there exists an optimal periodic schedule of exponential length. We propose randomized finite-memory (RFM) schedules as a compact description of the agent's strategies and design an efficient algorithm for constructing RFM schedules. Furthermore, we construct deterministic periodic schedules by sampling from RFM schedules.
APA, Harvard, Vancouver, ISO, and other styles
5

"ICOCWC 2024 Schedule." In 2024 International Conference on Optimization Computing and Wireless Communication (ICOCWC). IEEE, 2024. http://dx.doi.org/10.1109/icocwc60930.2024.10470574.

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

"Programme Schedule." In 2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO). IEEE, 2020. http://dx.doi.org/10.1109/icrito48877.2020.9197839.

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

"Programme Schedule." In 2022 10th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO). IEEE, 2022. http://dx.doi.org/10.1109/icrito56286.2022.9964776.

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

"Programme Schedule." In 2021 9th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO). IEEE, 2021. http://dx.doi.org/10.1109/icrito51393.2021.9596355.

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

Zhao, Hongbo, and Zhongliang Ru. "Construction Schedule Optimization Using Particle Swarm Optimization." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.1842.

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

Shrestha, Kabindra K., and Pramen P. Shrestha. "Optimization of Project Schedule Crashing." In Construction Research Congress 2016. American Society of Civil Engineers, 2016. http://dx.doi.org/10.1061/9780784479827.072.

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

Reports on the topic "The schedule optimization"

1

Backlund, Peter, Darryl J. Melander, Adam J. Pierson, et al. Schedule Management Optimization (SMO) Domain Model: Version 1.2. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1467776.

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

Detamore, J. A., M. H. Raudenbush, R. W. Wolaver, and G. A. Hastings. TRU Waste Management Program. Cost/schedule optimization analysis. Office of Scientific and Technical Information (OSTI), 1985. http://dx.doi.org/10.2172/5471332.

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

Detamore, J. A., M. H. Raudenbush, R. W. Wolaver, and G. A. Hastings. TRU Waste Management Program cost/schedule optimization analysis. Office of Scientific and Technical Information (OSTI), 1985. http://dx.doi.org/10.2172/5142784.

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

Pierce, G. D., D. H. Beaulieu, R. W. Wolaver, and P. H. Carson. Defense Remote Handled Transuranic Waste Cost/Schedule Optimization Study. Office of Scientific and Technical Information (OSTI), 1986. http://dx.doi.org/10.2172/5114735.

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

Flory, John Andrew, Denise D. Padilla, John H. Gauthier, April Marie Zwerneman, and Steven P. Miller. Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits. Office of Scientific and Technical Information (OSTI), 2016. http://dx.doi.org/10.2172/1259554.

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

Yang, Yu, and Hen-Geul Yeh. Electrical Vehicle Charging Infrastructure Design and Operations. Mineta Transportation Institute, 2023. http://dx.doi.org/10.31979/mti.2023.2240.

Full text
Abstract:
California aims to achieve five million zero-emission vehicles (ZEVs) on the road by 2030 and 250,000 electrical vehicle (EV) charging stations by 2025. To reduce barriers in this process, the research team developed a simulation-based system for EV charging infrastructure design and operations. The increasing power demand due to the growing EV market requires advanced charging infrastructures and operating strategies. This study will deliver two modules in charging station design and operations, including a vehicle charging schedule and an infrastructure planning module for the solar-powered charging station. The objectives are to increase customers’ satisfaction, reduce the power grid burden, and maximize the profitability of charging stations using state-of-the-art global optimization techniques, machine-learning-based solar power prediction, and model predictive control (MPC). The proposed research has broad societal impacts and significant intellectual merits. First, it meets the demand for green transportation by increasing the number of EV users and reducing the transportation sector’s impacts on climate change. Second, an optimal scheduling tool enables fast charging of EVs and thus improves the mobility of passengers. Third, the designed planning tools enable an optimal design of charging stations equipped with a solar panel and battery energy storage system (BESS) to benefit nationwide transportation system development.
APA, Harvard, Vancouver, ISO, and other styles
7

Dumas, Nathalie, Flourentzou Flourentzos, Julien BOUTILLIER, Bernard Paule, and Tristan de KERCHOVE d’EXAERDE. Integration of smart building technologies costs and CO2 emissions within the framework of the new EPIQR-web application. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541616188.

Full text
Abstract:
The EPIQR method was developed between 1996 and 1998 within the framework of the European research programme JOULE II and with the support of the Swiss Federal Office for Education and Science. In its first versions, the EPIQR software and EPIQR+ that succeeded it, were desktop tools, allowing a precise diagnosis of the state of deterioration of an existing building and the elaboration of renovation scenarios including the different costs of the necessary works. However, deep refurbishment rate is still low. Climatic emergency state declared by most of the Swiss Cantons makes it necessary to search also for other strategies for urgent reduction of CO2 emissions. As part of the PRELUDE project, a web version of this tool has been developed to integrate both smart technologies and energy optimization actions. Some of them can be considered as soft actions, making it possible to develop a soft renovation roadmap for buildings that are not scheduled for renovation in the short term. As examples, the costs of optimization contracts, intelligent heating control, demand-controlled ventilation, abandonment of heat production from fossil fuels, integration of renewable energies into the building, and communities’ creation for self-consumption of photovoltaic production have now been modelled. Το help the residential building stock fit with the CO2 reduction of 60% by 2030 compliance and the “2000 W society” energy sobriety target by 2050, the EPIQR-WEB database includes the CO2 indirect emissions of each refurbishment action. Hence, this updated version enables the building diagnosis expert to evaluate and optimise deep refurbishment scenarios, from both financial and environmental point of view. Parallel calculation of CO2 indirect emissions with the calculation of refurbishment cost is done without extra time cost for the user. The paper will show the software new functions, the EPIQR-WEB database expansion and how its overall results can be used to meet the European Union Climate Target through a realistic and comprehensive investment plan.
APA, Harvard, Vancouver, ISO, and other styles
8

Schedule optimization study implementation plan. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10109190.

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

Schedule Optimization Study, Hanford RI/FS Program. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/6985385.

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

Schedule Optimization Study, Hanford RI/FS Program. Volume 2, Final report. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/10115002.

Full text
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!

To the bibliography