Pages that link to "Item:Q1092805"

The following pages link to Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805):

Displaying 33 items.

• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
• Single-machine scheduling with stepwise tardiness costs and release times (Q656444) (← links)
• Some remarks on the decomposition properties of the single machine total tardiness problem (Q856256) (← links)
• Algebraic decompositions of DP problems with linear dynamics (Q888809) (← links)
• Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← 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)
• A dynamic programming method for single machine scheduling (Q1331548) (← 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)
• Solution of the single machine total tardiness problem (Q1592283) (← links)
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• On the single machine total tardiness problem (Q1771373) (← links)
• Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
• On decomposition of the total tardiness problem (Q1924615) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← 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)
• A new decomposition approach for the single machine total tardiness scheduling problem (Q3157785) (← links)
• On the Single-machine Scheduling Problem with Tardiness Penalties (Q3983490) (← links)
• Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine (Q4497861) (← links)
• Insights into two solution procedures for the single machine tardiness problem (Q4656685) (← links)
• The Total Tardiness Problem: Review and Extensions (Q4834060) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)
• Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm (Q5687644) (← links)