We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can scale its speed between 0 and some maximum speed T . The processor uses energy at rate s when run at speed s, where α > 1 is a constant. Most modern processors use dynamic speed scaling to manage their energy usage. This leads to the problem of designing execution strategies that are both energy e...

in this study, the performance of an irreversible regenerative brayton cycle is sought through power maximizations using finite-time thermodynamic concept in finite-size components. optimizations are performed using a genetic algorithm. in order to take into account the finite-time and finite-size concepts in the current problem, a dimensionless mass-flow rate parameter is used to deploy time v...

The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job mmachine problem is known to be NP hard problem, several meta heuristics have been applied so far in the...

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).

During the manufacturing process in a steel mill, the chemical composition and quality of raw-iron, steel and slack has to be checked several times. The organization of the corresponding list of operations can be classified as a hybrid flow shop scheduling problem with jobs arriving over time and the objective is to minimize the total weighted completion time. Since this problem is known to be ...

in this paper the concept of the minimum universal cost flow (mucf) for an infeasible flow network is introduced. a new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. a polynomial time algorithm is presented to find the mucf.

BACKGROUND AND PURPOSE Perfusion-weighted imaging maps are used to identify critical hypoperfusion in acute stroke. However, quantification of perfusion may depend on the choice of the arterial input function (AIF). Using quantitative positron emission tomography we evaluated the influence of the AIF location on maps of absolute and relative perfusion-weighted imaging to detect penumbral flow (...

The single-machine scheduling problem with a weight-modifying-activity (WMA) to minimize the total weighted completion time was initially addressed by Mosheiov and Oron in 2020, where activity an option, once performed, weights of subsequent jobs become decreased. This has proven be NP-hard. Following their study, we propose two mixed integer linear programming models (model_1 model_2). Based o...

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...