Pages that link to "Item:Q2884524"

The following pages link to An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem (Q2884524):

Displaying 50 items.

• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
• Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
• Minimizing conditional-value-at-risk for stochastic scheduling problems (Q398891) (← links)
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
• Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem (Q928082) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481) (← links)
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664) (← links)
• A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (Q1628053) (← links)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
• A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs (Q1665390) (← links)
• An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
• Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553) (← links)
• New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
• Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← 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)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
• Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
• An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
• Integrated batch sizing and scheduling on a single machine (Q2434256) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints (Q2480060) (← links)
• Predictive-reactive scheduling on a single resource with uncertain future jobs (Q2482799) (← links)