Pages that link to "Item:Q1278530"

The following pages link to Evaluation of leading heuristics for the single machine tardiness problem (Q1278530):

Displaying 11 items.

• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• A heuristic for the single machine tardiness problem (Q1310015) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (Q2564876) (← links)
• Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem (Q4347409) (← links)
• Single machine group scheduling with family setups to minimize total tardiness (Q5385473) (← links)
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)
• Sequencing jobs on a single machine: A neural network approach (Q5928440) (← links)