A wide variety of decision problems in operations research are defined on temporal networks, that is, workflows of time-consuming tasks whose processing order is constrained by precedence relations. For example, temporal networks are used to formalise the management of projects, the execution of computer applications, the design of digital circuits and the scheduling of production processes. Op...

this paper surveys parallel scheduling problems and metrics correlated to and then applys metrics to make decision in comparison to other policy schedulers. parallel processing is new trend in computer science especially in embedded and multicore systems whereas needs more power consumption to reach speed up. the qos requirement for users is to have good responsiveness and for service providers...

Cloud Computing is the technology that provides on demand services and resources like storage space, networks, programming language execution environment on the top of Internet using pay as you go model. The concept of Cloud Computing emerging as a latest model of service provisioning in distributed system encourage researchers to investigate its advantages and drawbacks in executing scientific...

This paper presents a heuristic algorithm for solving a job-shop scheduling problem with sequence dependent setup times (SDST-JSSP). The algorithm relies on a core constraint-based search procedure, which generates a consistent ordering of activities requiring the same resource by incrementally imposing precedence constraints on a temporally feasible solution. Key to the effectiveness of the se...

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...

Traditional scheduling models assume that the execution time of a job in a periodic job-set is constant in every instance of its execution. This assumption does not hold in real-time systems wherein job execution time is known to vary. A second feature of traditional models is their lack of expressiveness, in that constraints more complex than precedence constraints (for instance, relative timi...

Many modern logic programming languages provide more flexible scheduling than the Prolog traditional left-to-right computation rule. Computation generally also proceeds following some ñxed scheduling rule but certain goals are dynamically "delayed" until their arguments are sufficiently instantiated to allow the cali to run efliciently. This general form of scheduling is referred to as dynamic ...

This paper presents a heuristic algorithm for solving the job-shop scheduling problem with sequence dependent setup times (SDST-JSSP). The algorithm relies on a core constraint-based search procedure, which generates consistent ordering of activities requiring the same resource by incrementally imposing precedence constraints on a temporal feasible solution. Key to the effectiveness of the sear...

This paper presents a new multiple time grid continuous time MILP model for the short-term scheduling of multistage, multiproduct plants. It can handle both release and due dates and different objective functions efficiently, such as the minimization of total cost, total earliness or makespan. This formulation is compared to other existing mixed-integer linear programming approaches and to a co...

The Virtual Data Space is a standard C-library which automatically distributes the work-packets generated by parallel applications across the processing nodes. VDS is a universal system ooering loadbalancing-mechanisms for applications which incorporate independent load-items and scheduling algorithms for those which comprise precedence-constraints between their diierent tasks. This paper prese...