Pages that link to "Item:Q2468493"
From MaRDI portal
The following pages link to Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493):
Displaying 17 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
- A Lagrangian-ACO matheuristic for car sequencing (Q2513756) (← links)