A GRASP based on DE to solve single machine scheduling problem with SDST
From MaRDI portal
Publication:434179
DOI10.1007/s10589-010-9333-7zbMath1245.90027OpenAlexW2043154904MaRDI QIDQ434179
Abdelwaheb Rebaï, Hanen Akrout, Bassem Jarboui, Patrick Siarry
Publication date: 10 July 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9333-7
sequence-dependent setup timestotal tardinessdifferential evolutiongreedy randomized adaptive search procedurescheduling single machine
Related Items (4)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
Cites Work
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A GRASP for a difficult single machine scheduling problem
- Scheduling in a sequence dependent setup environment with genetic search
- Variable neighborhood search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Scheduling under machine breakdown in a continuous process industry
- Greedy randomized adaptive search procedures
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- Minimizing Total Tardiness on One Machine is NP-Hard
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Variable neighborhood search: Principles and applications
- A memetic algorithm for the total tardiness single machine scheduling problem
This page was built for publication: A GRASP based on DE to solve single machine scheduling problem with SDST
