Pages that link to "Item:Q868992"
From MaRDI portal
The following pages link to A comparison of lower bounds for the single-machine early/tardy problem (Q868992):
Displaying 8 items.
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties (Q1017438) (← links)
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint (Q2429001) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
- Single machine scheduling with family setups to minimize total earliness and tardiness (Q2467252) (← links)
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)
