Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
22,529
Benchmarks for Basic Scheduling Problems
, 1989
"... In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. ..."
Abstract
-
Cited by 233 (0 self)
- Add to MetaCart
In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems.
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
- ARTIF. INTELL
, 1992
"... This paper describes a simple heuristic approach to solving large-scale 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-orderin ..."
Abstract
-
Cited by 457 (6 self)
- Add to MetaCart
This paper describes a simple heuristic approach to solving large-scale 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
Voltage Scheduling Problem for Dynamically Variable Voltage Processors
, 2000
"... This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. ..."
Abstract
-
Cited by 403 (5 self)
- Add to MetaCart
This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization.
Algorithms for the vehicle routing and scheduling problems with time window constraints
- OPERATIONS RESEARCH, VOL. 35, NO. 2. (MAR.- APR., 1987)
, 1987
"... ..."
Scheduling problems
, 2014
"... We introduce the notion of a scheduling problem which is a boolean function S over atomic formulas of the form xi ≤ xj. Considering the xi as jobs to be performed, an integer assignment satisfying S schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting funct ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We introduce the notion of a scheduling problem which is a boolean function S over atomic formulas of the form xi ≤ xj. Considering the xi as jobs to be performed, an integer assignment satisfying S schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting
Scheduling Problem
"... We applied genetic algorithm to nurse scheduling problem. For time complexity problem of genetic algorithm, we suggested efficient operators using a cost bit matrix of which each cell indicates any violation of constraints. A cell with 1 indicates that the corresponding assignment violates constrain ..."
Abstract
- Add to MetaCart
We applied genetic algorithm to nurse scheduling problem. For time complexity problem of genetic algorithm, we suggested efficient operators using a cost bit matrix of which each cell indicates any violation of constraints. A cell with 1 indicates that the corresponding assignment violates
Scheduling Problems
"... In this article we will give firstly a classification scheme of scheduling problems and their solving methods. The main aspects under examination are the following: machine and secondary resources, constraints, objective functions, uncertainty, mathematical models and adapted solution methods. In a ..."
Abstract
- Add to MetaCart
In this article we will give firstly a classification scheme of scheduling problems and their solving methods. The main aspects under examination are the following: machine and secondary resources, constraints, objective functions, uncertainty, mathematical models and adapted solution methods. In a
Results 1 - 10
of
22,529
