Sciweavers

131 search results - page 2 / 27
» A Hybrid Constraint Programming Local Search Approach to t...
Sort
View
JSW
2006
76views more  JSW 2006»
13 years 4 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
CP
2009
Springer
13 years 11 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
ICDIM
2007
IEEE
13 years 11 months ago
A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) ...
Hongbo Liu, Ajith Abraham, Crina Grosan
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 8 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
JAIR
2007
111views more  JAIR 2007»
13 years 4 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson