131 search results - page 1 / 27 » A Hybrid Constraint Programming Local Search Approach to t... |
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
IJCNN
2006
IEEE
13 years 10 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
AIPS
2008
13 years 6 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
CP
2005
Springer
13 years 10 months ago
2005
Springer
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
12 years 11 months ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...