Results 1  10
of
973,815
Complexity of the Single Vehicle Scheduling Problem on Graphs
, 1997
"... : Let G = (V; E) be a graph. The travel times w(u; v) and w(v; u) are associated with each edge fu; vg 2 E, and a job, which is also denoted as v, is located at each node v 2 V . Each job v has release time r(v) and handling time h(v). A start node s 2 V and a set Q V of goal nodes are specied. Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. The VSP (Vehicle Scheduling Problem) asks to nd a routing schedule of the single vehicle that starts from node s at time 0 and reaches one of the goal nodes in Q after visiting all jobs v 2 V for processing. The processing of a job v cannot be started before its release time t = r(v) (hence the vehicle
Singlevehicle Scheduling Problem on a Straight Line with Time Window Constraints
 Electronic Notes in Theoretical Computer Science, Elsevier Science B.V., ENTCS 65.6
, 1995
"... The problem of singlevehicle scheduling with ready time and deadline constraints can be applicable to many practical transportation problems. But the general case is a generalization of classical Traveling Salesman Problem and it is NPhard. Psaraftis[1] presented an O(n 2 ) algorithm for vehicle ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The problem of singlevehicle scheduling with ready time and deadline constraints can be applicable to many practical transportation problems. But the general case is a generalization of classical Traveling Salesman Problem and it is NPhard. Psaraftis[1] presented an O(n 2 ) algorithm
A 1.5Approximation for SingleVehicle Scheduling Problem on a Line with Release and Handling Times
 In JapanU.S.A. Symposium on Flexible Automation
, 1998
"... In this paper we consider a singlevehicle scheduling problem on a straight line. Let L = (V; E) be a line, where V = fv 1 ; v 2 ; . . . ; v n g is a set of n vertices and E = ffv i ; v i+1 g j i = 1; 2; . . . ; n 1g is a set of edges. The travel times d(u; v) and d(v; u) are associated with each e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we consider a singlevehicle scheduling problem on a straight line. Let L = (V; E) be a line, where V = fv 1 ; v 2 ; . . . ; v n g is a set of n vertices and E = ffv i ; v i+1 g j i = 1; 2; . . . ; n 1g is a set of edges. The travel times d(u; v) and d(v; u) are associated with each
Single Vehicle Scheduling Problem for Processing a Maximum Benefit Subset of Jobs on a Line
"... In this paper, we study a problem of finding a scheduling for a single vehicle to process jobs located on a single line, where each job has a handling time, a time window (a pair of a release time and a deadline), and a beneflt. The objective is to maximize the total benefit from jobs processed by t ..."
Abstract
 Add to MetaCart
In this paper, we study a problem of finding a scheduling for a single vehicle to process jobs located on a single line, where each job has a handling time, a time window (a pair of a release time and a deadline), and a beneflt. The objective is to maximize the total benefit from jobs processed
New Approximation Algorithms for Vehicle Scheduling Problems
"... We consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2approximation algorithms were known for several variants of the single vehicle problem on a path [15]. A 3=2approximation algorithm was known for the single vehicle problem on a path whe ..."
Abstract
 Add to MetaCart
We consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2approximation algorithms were known for several variants of the single vehicle problem on a path [15]. A 3=2approximation algorithm was known for the single vehicle problem on a path
Scheduling Multithreaded Computations by Work Stealing
, 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal com ..."
Abstract

Cited by 561 (33 self)
 Add to MetaCart
This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3697 (2 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
Trace Scheduling: A Technique for Global Microcode Compaction
 IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of highlevel microcode languages int ..."
Abstract

Cited by 680 (5 self)
 Add to MetaCart
into efficient horizontal microcode and good hand coding probably both require effective global compaction techniques. In this paper "trace scheduling" is developed as a solution to the global compaction problem. Trace scheduling works on traces (or paths) through microprograms. Compacting is thus done
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 926 (19 self)
 Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
 ARTIF. INTELL
, 1992
"... This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a valueorderin ..."
Abstract

Cited by 454 (6 self)
 Add to MetaCart
This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value
Results 1  10
of
973,815