Spelling suggestions: "subject:"periodic scheduling"" "subject:"eriodic scheduling""
1 |
On-line periodic scheduling of hybrid chemical plants with parallel production lines and shared resourcesSimeonova, Iliyana 28 August 2008 (has links)
This thesis deals with chemical plants constituted by parallel batch-continuous production lines with shared resources.
For such plants, it is highly desirable to have optimal operation schedules which determine the starting times of the various batch processes and the flow rates of the continuous processes in order to maximize the average plant productivity and to have a continuous production without interruptions. This optimization problem is constrained by the limitation of the resources that are shared by the reactors and by the capacities of the various devices that constitute the plant.
Such plants are "hybrid" by nature because they combine both continuous-time dynamics and discrete-event dynamics. The formalism of "Hybrid Automata" is there fore well suited for the design of plant models.
The first contribution of this thesis is the development of a hybrid automaton model of the chemical plant in the Matlab-Simulink-Stateflow environment and its use for the design of an optimal periodic schedule that maximises the plant productivity. Using a sensitivity analysis and the concept of Poincaré; map, it is shown that the optimal schedule is a stable limit cycle of the hybrid system that attracts the system trajectories starting in a wide set of initial conditions.
The optimal periodic schedule is valid under the assumption that the hybrid model is an exact description of the plant. Under perturbations on the plant parameters, it is shown that two types of problems may arise. The first problem is a drift of the hybrid system trajectory which can either lead to a convergence to a new stable sub-optimal schedule or to a resource conflict. The second problem is a risk of overflow or underflow of the output buffer tank. The second contribution of the thesis is the analysis of feedback control strategies to avoid these problems. For the first problem, a control policy based on a model predictive control (MPC) approach is proposed to avoid resource conflicts. The feedback control is run on - line with the hybrid Simulink-Stateflow simulator used as an internal model. For the solution of the second problem, a classical PI control is used. The goal is not only to avoid over- or under-filling of the tank but also to reduce the amplitude of outflow rate variations as much as possible. A methodological analysis for the PI controller tuning is presented in order to achieve an acceptable trade-off between these conflicting objectives.
|
2 |
Tactical and operational planning for per-seat, on-demand air transportationKeysan, Gizem 29 May 2009 (has links)
This thesis addresses two planning problems motivated by the operations of PSOD air transportation: scheduled maintenance planning, and base location and fleet allocation.
In the first part of the thesis, we study tactical planning for scheduled maintenance which determines the daily maintenance capacities for two operating conditions: a growth phase and the steady state. We model tactical maintenance capacity planning during the growth phase as an integer program and develop an optimization-based local search to solve the problem. Tactical planning of steady state maintenance capacity concerns a special case for which we determine the optimal and the long run capacities with a pseudo-polynomial time algorithm.
In the second part of the thesis, we address operational planning for scheduled maintenance which is concerned with assigning itineraries to jets and determining the specific jets to be scheduled for maintenance on a daily basis given a certain maintenance capacity. We present a solution methodology that employs a look-ahead approach to consider the impact of our current decisions on the future and decomposes the problem exploiting the differences between jets with respect to the proximity to their next maintenance. We further develop an integrated framework in order to capture the interaction between operational level maintenance decisions and flight scheduling.
In the third and final part of the thesis, we present the tactical level base location and fleet allocation problem. As PSOD air transportation experiences changes in travel demand and fleet size, decisions regarding where to open new bases and how to allocate the number of jets among the bases are made. We first present a solution approach in which high level information about flight scheduling is used in a traditional facility location problem. We next develop a model that works directly with transportation requests and integrates a simplified version of flight scheduling with the base location and fleet allocation decisions in order to capture more detail.
|
3 |
Integrating Combinatorial Scheduling with Inventory Management and Queueing TheoryTerekhov, Daria 13 August 2013 (has links)
The central thesis of this dissertation is that by combining classical scheduling methodologies with those of inventory management and queueing theory we can better model, understand and solve complex real-world scheduling problems. In part II of this dissertation, we provide models of a realistic supply chain scheduling problem that capture both its combinatorial nature and its dependence on inventory availability. We present an extensive empirical evaluation of how well implementations of these models in commercially available software solve the problem. We are therefore able to address, within a specific problem, the need for scheduling to take into account related decision-making processes. In order to simultaneously deal with combinatorial and dynamic properties of real scheduling problems, in part III we propose to integrate queueing theory and deterministic scheduling. Firstly, by reviewing the queueing theory literature that deals with dynamic resource allocation and sequencing and outlining numerous future work directions, we build a strong foundation for the investigation of the integration of queueing theory and scheduling. Subsequently, we demonstrate that integration can take place on three levels: conceptual, theoretical and algorithmic. At the conceptual level, we combine concepts, ideas and problem settings from the two areas, showing that such combinations provide insights into the trade-off between long-run and short-run objectives. Next, we show that theoretical integration of queueing and scheduling can lead to long-run performance guarantees for scheduling algorithms that have previously been proved only for queueing policies. In particular, we are the first to prove, in two flow shop environments, the stability of a scheduling method that is based on the traditional scheduling literature and utilizes processing time information to make sequencing decisions. Finally, to address the algorithmic level of integration, we present, in an extensive future work chapter, one general approach for creating hybrid queueing/scheduling algorithms. To our knowledge, this dissertation is the first work that builds a framework for integrating queueing theory and scheduling. Motivated by characteristics of real problems, this dissertation takes a step toward extending scheduling research beyond traditional assumptions and addressing more realistic scheduling problems.
|
4 |
Integrating Combinatorial Scheduling with Inventory Management and Queueing TheoryTerekhov, Daria 13 August 2013 (has links)
The central thesis of this dissertation is that by combining classical scheduling methodologies with those of inventory management and queueing theory we can better model, understand and solve complex real-world scheduling problems. In part II of this dissertation, we provide models of a realistic supply chain scheduling problem that capture both its combinatorial nature and its dependence on inventory availability. We present an extensive empirical evaluation of how well implementations of these models in commercially available software solve the problem. We are therefore able to address, within a specific problem, the need for scheduling to take into account related decision-making processes. In order to simultaneously deal with combinatorial and dynamic properties of real scheduling problems, in part III we propose to integrate queueing theory and deterministic scheduling. Firstly, by reviewing the queueing theory literature that deals with dynamic resource allocation and sequencing and outlining numerous future work directions, we build a strong foundation for the investigation of the integration of queueing theory and scheduling. Subsequently, we demonstrate that integration can take place on three levels: conceptual, theoretical and algorithmic. At the conceptual level, we combine concepts, ideas and problem settings from the two areas, showing that such combinations provide insights into the trade-off between long-run and short-run objectives. Next, we show that theoretical integration of queueing and scheduling can lead to long-run performance guarantees for scheduling algorithms that have previously been proved only for queueing policies. In particular, we are the first to prove, in two flow shop environments, the stability of a scheduling method that is based on the traditional scheduling literature and utilizes processing time information to make sequencing decisions. Finally, to address the algorithmic level of integration, we present, in an extensive future work chapter, one general approach for creating hybrid queueing/scheduling algorithms. To our knowledge, this dissertation is the first work that builds a framework for integrating queueing theory and scheduling. Motivated by characteristics of real problems, this dissertation takes a step toward extending scheduling research beyond traditional assumptions and addressing more realistic scheduling problems.
|
Page generated in 0.0984 seconds