Results 51 to 60 of about 34,025 (156)
Foundations of Computing and Decision SciencesIn this paper, we will study the permutation flow shop scheduling problem (PFSSP) with sequence independent setup time (SIST). This constraint is the most common encountered in industrial production.
Sadki Hajar, Allali Karam
doaj +1 more source
On the size of weights in randomized search heuristics
, 2008 Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search heuristic does not change. Upper bounds on the size of the new, equivalent weights allow us to obtain
Reichel, Joachim, Skutella, Martin
openaire +2 more sources
On the Border Length Minimization Problem (BLMP) on a Square Array
, 2010 Protein/Peptide microarrays are rapidly gaining momentum in the diagnosis of cancer. High-density and highthroughput peptide arrays are being extensively used to detect tumor biomarkers, examine kinase activity, identify antibodies having low serum ...
Dinh, Hieu +2 more
core +1 more source
Construction of near-optimal vertex clique covering for real-world networks [PDF]
, 2015 We propose a method based on combining a constructive and a bounding heuristic to solve the vertex clique covering problem (CCP), where the aim is to partition the vertices of a graph into the smallest number of classes, which induce cliques.
Chalupa, David
core
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
, 2011 The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common.
Barbulescu, L. +3 more
core +1 more source
Symbiosis of Search and Heuristics for Random 3-SAT
, 2014 Proceedings of the Third International Workshop on Logic and Search (LaSh 2010)
Mijnders, Sid +2 more
openaire +2 more sources
Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties [PDF]
In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies
Jorge M. S. Valente, Maria R. A. Moreira
core
A regret model applied to the maximum coverage location problem with queue discipline [PDF]
, 2013 This article discusses issues related to the location and allocation problems where is intended to demonstrate, through the random number generation, the influence of congestion of such systems in the final solutions.
Lourenço, Helena Ramalhinho +2 more
core
A regret model applied to the facility location problem with limited capacity facilities [PDF]
, 2013 This article addresses issues related to location and allocation problems. Herein, we intend to demonstrate the influence of congestion, through the random number generation, of such systems in final solutions.
Lourenço, Helena Ramalhinho +2 more
core
An Atypical Survey of Typical-Case Heuristic Algorithms
, 2012 Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without inducing seismic complexity-theoretic consequences?
Hemaspaandra, Lane A., Williams, Ryan
core