Sciweavers

COR
2010
164views more  COR 2010»
13 years 11 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
COR
2010
116views more  COR 2010»
13 years 11 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
COR
2010
150views more  COR 2010»
13 years 11 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
COR
2010
124views more  COR 2010»
13 years 11 months ago
On tandem blocking queues with a common retrial queue
We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available...
Konstantin Avrachenkov, Uri Yechiali
COR
2010
108views more  COR 2010»
13 years 11 months ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...
COR
2010
110views more  COR 2010»
13 years 11 months ago
An evolutionary method for complex-process optimization
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...
Jose A. Egea, Rafael Martí, Julio R. Banga
COR
2010
96views more  COR 2010»
13 years 11 months ago
Strong activity rules for iterative combinatorial auctions
Activity rules have emerged in recent years as an important aspect of practical auction design. The role of an activity rule in an iterative auction is to suppress strategic behav...
Pavithra Harsha, Cynthia Barnhart, David C. Parkes...
COR
2010
123views more  COR 2010»
13 years 11 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
COR
2010
78views more  COR 2010»
13 years 11 months ago
Hybrid Metaheuristics
Christian Blum