An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
From MaRDI portal
Publication:5172564
DOI10.1080/00207721.2012.723054zbMath1305.90160OpenAlexW2008440605MaRDI QIDQ5172564
Publication date: 4 February 2015
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2012.723054
Related Items (3)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- Unnamed Item
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Variable neighbourhood search: methods and applications
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- Scheduling in a sequence dependent setup environment with genetic search
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- A survey of scheduling problems with setup times or costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Enhancing stochastic search performance by value-biased randomization of heuristics
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A Meta-RaPS for the early/tardy single machine scheduling problem
- An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
- Single-machine scheduling with deteriorating jobs
- Using dispatching rules for job shop scheduling with due date-based objectives
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
This page was built for publication: An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
