Sciweavers

10493 search results - page 64 / 2099
» Dynamic Word Problems
Sort
View
HM
2010
Springer
157views Optimization» more  HM 2010»
13 years 9 months ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
André Renato Villela da Silva, Luiz Satoru ...
PRICAI
1998
Springer
14 years 1 days ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
AMC
2006
114views more  AMC 2006»
13 years 8 months ago
A multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
Amir Azaron, Reza Tavakkoli-Moghaddam
COR
2006
118views more  COR 2006»
13 years 7 months ago
Simulated annealing heuristics for the dynamic facility layout problem
In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the pro...
Alan R. McKendall Jr., Jin Shang, Saravanan Kuppus...
ORL
2000
77views more  ORL 2000»
13 years 7 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos