Sciweavers

1220 search results - page 120 / 244
» Minimal Interval Completions
Sort
View
COR
2010
164views more  COR 2010»
13 years 9 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
DISOPT
2010
129views more  DISOPT 2010»
13 years 9 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
AMC
2006
114views more  AMC 2006»
13 years 9 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
EOR
2008
86views more  EOR 2008»
13 years 9 months ago
Batch scheduling of deteriorating reworkables
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. E...
M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kova...
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 9 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman