This paper presents an open framework for building and evaluating new Quality of Service elements in a Linux based software router. Conventional QoS behavior, like bucket metering models or scheduling algorithms, have been split up to their elementary components to make the reuse and the variation of them easier. Therefore five kinds of QoS behavior types will be introduced. Based on this pool ...

This paper presents several scheduling/coscheduling techniques employed in some recent research projects. Two types of local scheduling, proportional-sharing scheduling and predictive scheduling are introduced here. With proportional-share scheduling, the resource consumption rights of each active process are proportional to the relative shares that it is allocated. While the system implementin...

This paper presents a static analysis of laminated composite doubly-curved shells using refined kinematic models with polynomial and non-polynomial functions recently introduced in the literature. To be specific, Maclaurin, trigonometric, exponential and zig-zag functions are employed. The employed refined models are based on the equivalent single layer theories. A simply supported shell is sub...

Discrete scheduling is preferred over continuous scheduling for preemptive scheduling problems, however, classical continuous schedulability tests can not work effectively with discrete scheduling. This area of integrating discrete scheduling with continuous schedulability tests remains unexplored. Two contributions are made in this paper; firstly, an empty-slot method is introduced and extende...

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

Constraint-based scheduling is an approach for solving real-life scheduling problems by combining the generality of AI techniques with the efficiency of OR techniques. Basically, it describes a scheduling problem as a constraint satisfaction problem and then uses constraint satisfaction techniques to find a solution. In this paper we study three constraint models describing complex state transi...

Data Envelopment Analysis (DEA) is a technique used to compare efficiency in various sectors such as hospitals, chain stores, and dealerships. It represents a set of linear programming techniques and uses deter-ministic data (inputs and outputs), in stable conditions. The DEA technique cannot be used when there is data with indeterministic nature, or when there is an environment with dynamic co...

A new model to deal with the short-term generation scheduling problem for hydrothermal systems is proposed. Using genetic algorithms (GAs), the model handles simultaneously the subproblems of short-term hydrothermal coordination, unit commitment, and economic load dispatch. Considering a scheduling horizon period of a week, hourly generation schedules are obtained for each of both hydro and the...

A novel formulation for combined scheduling and control of multi-product, continuous chemical processes is introduced in which nonlinear model predictive control (NMPC) and noncyclic continuous-time scheduling are efficiently combined. A decomposition into nonlinear programming (NLP) dynamic optimization problems and mixed-integer linear programming (MILP) problems, without iterative alternatio...