Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of t...

System virtualization provides low-cost, flexible and powerful executing environment for virtualized data centers, which plays an important role in the infrastructure of Cloud computing. However, the virtualization also brings some challenges, particularly to the resource management and task scheduling. This paper proposes an efficient dynamic task scheduling scheme for virtualized data centers...

Distributed real-time applications require efficient scheduling to improve processor and network utilization, and to avoid missing task deadlines. Current scheduling algorithms typically do not utilize applicationlevel information nor do they adapt to changes in application state. We describe a system in which users define dynamic, application-specific, scheduling policies using a fuzzy-logic a...

Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...

In the past, we demonstrated how fuzzy concepts can easily be used in the Johnson algorithm for managing uncertain scheduling on two-machine flow shops. This paper extends these concepts to fuzzy flow shops with more than two machines. A new fuzzy heuristic flow-shop scheduling algorithm (the fuzzy Gupta algorithm) is then designed since optimal solutions seem unnecessary for uncertain environm...

Abstract There are more problems of network data transmission in multi-loop NCS than in single loop NCS. It maybe lead to that one or more of closed-loop systems become unstable in multi-loop NCS. In order to solve this problem, a novel algorithm of fuzzy dynamic scheduling for multi-loop NCS is put forward in this paper. Firstly, the requirement of the sampling period of NCS is discussed. The ...

In many basic scheduling models, jobs’ processing times and due-dates are deterministic. Practically, they are as uncertain variables in some more models. Furthermore, in a real situation of decision making, there exists uncertainty that can not be described only by fuzziness but also randomness. The purpose of this paper is to develop a methodology for parallel machines scheduling problem with...

Genetic algorithm is one of the main heuristics that have been applied to scheduling problems in the last few decades. This paper presents a generalization of the genetic algorithm for solving project scheduling problem under time uncertainties within resource leveling technique. The generalization consists of handling fuzzy time parameter and fuzzy resource distribution instead of crisp ones. ...

this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...

The problem of Order Acceptance and Scheduling (OAS) is defined as a joint decision of which orders to accept for processing and how to schedule them. Any linear programming model representing real-world situation involves the parameters defined by the decision maker in an uncertain way or by means of language statement. Fuzzy data can be used to incorporate vagueness in the real-life situation...