Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Utilization Of Integer Programming For Scheduling Maintenance At Nuclear Power Plants, Timothy Gallacher
Utilization Of Integer Programming For Scheduling Maintenance At Nuclear Power Plants, Timothy Gallacher
Doctoral Dissertations
This thesis develops a thought that naturally explores three specific motifs for solving the complexities of scheduling maintenance at Nuclear Power Plants (NPP). The first chapter of this paper will develop the initial thought around creating a schedule for a given work week, including all the various constraints inherent to this problem. Such constraints include but are not limited to personnel availability, allowable component out-of-service time, and the Plant Risk Assessment. The objective function being to minimize the total cost of worker’s compensation for that given week.
The second chapter addresses the question of whether this simple schedule can be …
Heuristics For Lagrangian Relaxation Formulations For The Unit Commitment Problem, Stephen Opeyemi Fatokun
Heuristics For Lagrangian Relaxation Formulations For The Unit Commitment Problem, Stephen Opeyemi Fatokun
Doctoral Dissertations
The expansion of distributed energy resources (DER), demand response (DR), and virtual bidding in many power systems and energy markets are creating new challenges for unit commitment (UC) and economic dispatch (ED) techniques. Instead of a small number of traditionally large generators, the power system resource mix is moving to one with a high percentage of a large number of small units. These can increase the number of similar or identical units, leading to chattering (switching back and forth among committed units between iterations). This research investigates alternative and scalable ways of increasing the high penetration of these resources.
First, …