Sciweavers

190 search results - page 19 / 38
» A monotone approximation algorithm for scheduling with prece...
Sort
View
GECCO
2006
Springer
190views Optimization» more  GECCO 2006»
14 years 4 days ago
Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...
Haipeng Zhang, Mitsuo Gen
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
IPPS
2010
IEEE
13 years 6 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
CP
2005
Springer
14 years 2 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 9 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...