Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
From MaRDI portal
Publication:2468493
DOI10.1016/j.cor.2006.11.004zbMath1177.90186OpenAlexW2168623380MaRDI QIDQ2468493
Jorge M. S. Valente, Rui A. F. S. Alves
Publication date: 23 January 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/3457
Related Items
On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ Extended beam search for non-exhaustive state space analysis ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites Work
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- Real-time scheduling of an automated manufacturing center
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Scheduling with batching: A review
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Enhancing stochastic search performance by value-biased randomization of heuristics
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- The Single Machine Early/Tardy Problem
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Unnamed Item
- Unnamed Item
- Unnamed Item
