Pages that link to "Item:Q1092805"
From MaRDI portal
The following pages link to Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805):
Displaying 18 items.
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- Algebraic decompositions of DP problems with linear dynamics (Q888809) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems (Q1266611) (← links)
- Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
- A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
- A heuristic for the single machine tardiness problem (Q1310015) (← links)
- Decomposition of the single machine total tardiness problem (Q1362989) (← links)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
- A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
- Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)