We present a hierarchic scheduling framework for Linux called Group Scheduling that facilitates the creation of arbitrary thread schedulers. Traditional approaches to developing new scheduling semantics require semantic mappings onto existing schedulers, such as static-priority. Group Scheduling allows for a direct implementation of semantics, allowing clear mappings at any level a developer de...

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

In this paper, we present a new topic in connection with project scheduling. Since a limited work space can form a restriction to project scheduling problems, an efficient usage of these work spaces (or so-called spatial resources) is required to produce good project schedules. The requirement for the resource units of these spatial resources is in an adjacent manner (we cannot place a product ...

In Desktop Grids, volunteers (i.e, resource providers) have heterogeneous properties and dynamically join and leave during execution. Moreover, some volunteers may behave erratically or maliciously. Thus, it is important to detect and tolerate erroneous results (i.e., result certification) in order to guarantee reliable execution, considering volatility and heterogeneity in a scheduling procedu...

background and objectives: operating room (or) scheduling is key to optimal operating room productivity. the significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. this paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. the model considers various surgical operation co...