Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Some Topics On Deterministic Scheduling Problems, Yumei Huo
Some Topics On Deterministic Scheduling Problems, Yumei Huo
Dissertations
Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives.
This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on m >= 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. Both preemptive and nonpreemptive schedules are considered. This dissertation shows that optimal …
Algorithms And Complexity Analyses For Some Combinational Optimization Problems, Hairong Zhao
Algorithms And Complexity Analyses For Some Combinational Optimization Problems, Hairong Zhao
Dissertations
The main focus of this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design.
In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. Each slave task has a dedicated slave machine. All the preprocessing and postprocessing tasks share a single master machine or the same set of master machines. A job may …