A memetic algorithm for the job-shop with time-lags
From MaRDI portal
Publication:2468490
DOI10.1016/j.cor.2006.11.007zbMath1177.90147OpenAlexW2065272991MaRDI QIDQ2468490
Anthony Caumond, Nikolay Tchernev, Philippe Lacomme
Publication date: 23 January 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.11.007
Related Items
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ Weight-based heuristics for constraint satisfaction and combinatorial optimization problems ⋮ Unnamed Item ⋮ Computing minimal doubly resolving sets of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of priority rule-based scheduling
- Time lag size in multiple operations flow shop scheduling heuristics
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- One-machine generalized precedence constrained scheduling problems
- A genetic algorithm for flowshop sequencing
- Approximative procedures for no-wait job shop scheduling.
- Job-shop scheduling with blocking and no-wait constraints
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Single machine scheduling subject to precedence delays
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Two-machine open shop scheduling with special transportation times
- Job Shop Scheduling by Simulated Annealing
- Algorithms for Solving Production-Scheduling Problems
