Pages that link to "Item:Q1762139"

The following pages link to A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139):

Displaying 30 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
• An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
• A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← 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)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
• Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909) (← links)
• A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times (Q1791956) (← links)
• Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
• A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
• Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem (Q2510186) (← links)
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← links)
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem (Q5059236) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (Q5432690) (← links)
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)