Pages that link to "Item:Q1433664"

The following pages link to An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664):

Displaying 25 items.

• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
• Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem (Q928082) (← links)
• A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
• A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime (Q2061131) (← links)
• A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
• An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints (Q2480060) (← links)
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
• Fast neighborhood search for the single machine total weighted tardiness problem (Q2583706) (← links)
• On the theoretical properties of swap multimoves (Q2643800) (← links)
• Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem (Q3430248) (← links)
• Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)
• A Memetic Model Based on Fixed Structure Learning Automata for Solving NP-Hard Problems (Q5861760) (← links)