Pages that link to "Item:Q3392290"

The following pages link to BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290):

Displaying 9 items.

• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← 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)
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem (Q4656749) (← links)