Pages that link to "Item:Q1262207"

The following pages link to A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207):

Displaying 43 items.

• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• Single machine scheduling with interfering job sets (Q336975) (← 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)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
• A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling (Q875408) (← links)
• Scheduling a hybrid flowshop with batch production at the last stage (Q875417) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
• A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← 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)
• Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties (Q1368414) (← links)
• Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
• A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
• An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem (Q1761154) (← links)
• Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• Augmentations of consistent partial orders for the one-machine total tardiness problem (Q1917355) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives (Q2424773) (← links)
• Minimizing total tardiness on a single machine with unequal release dates (Q2462144) (← links)
• Predictive-reactive scheduling on a single resource with uncertain future jobs (Q2482799) (← links)
• The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
• A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM (Q2790358) (← links)
• A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
• One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons (Q2875603) (← links)
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem (Q3430248) (← links)
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)