An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
From MaRDI portal
Publication:2884524
DOI10.1287/ijoc.14.1.52.7712zbMath1238.90061OpenAlexW2164483807MaRDI QIDQ2884524
Richard K. Congram, Chris N. Potts, Steef L. van de Velde
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/67282a355222c4826adbd89aba258be5dbed525f
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Approximation algorithms for minimizing the total weighted tardiness on a single machine, A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints, Fast neighborhood search for the single machine earliness-tardiness scheduling problem, Procedures for the bin packing problem with precedence constraints, Optimal restricted due date assignment in scheduling, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, Dominance-based heuristics for one-machine total cost scheduling problems, A tabu search algorithm for the single machine total weighted tardiness problem, Two very large-scale neighborhoods for single machine scheduling, On the theoretical properties of swap multimoves, Metaheuristics for the single machine weighted quadratic tardiness scheduling problem, Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity, An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, Split-merge: using exponential neighborhood search for scheduling a batching machine, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs, An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands, A dynamic programming-based matheuristic for the dynamic berth allocation problem, Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective, On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Minimizing conditional-value-at-risk for stochastic scheduling problems, MPILS: an automatic tuner for MILP solvers, An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem, Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem, Matching based very large-scale neighborhoods for parallel machine scheduling, An exponential (matching based) neighborhood for the vehicle routing problem, Integrated batch sizing and scheduling on a single machine, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, A greedy-based neighborhood search approach to a nurse rostering problem., Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem, An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem, Exponential neighborhood search for a parallel machine scheduling problem, Approximation algorithms for scheduling problems with a modified total weighted tardiness objective, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems, Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints, Predictive-reactive scheduling on a single resource with uncertain future jobs, Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem, A survey of very large-scale neighborhood search techniques, An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, An exact algorithm for single-machine scheduling without machine idle time, A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems, Iterated local search for the quadratic assignment problem, A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM, A population-based variable neighborhood search for the single machine total weighted tardiness problem, Interval-indexed formulation based heuristics for single machine total weighted tardiness problem, Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands, New results for scheduling to minimize tardiness on one machine with rejection and related problems, Finding the maximum multi improvement on neighborhood exploration, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, The single-machine total tardiness scheduling problem: review and extensions, Hybridizing exact methods and metaheuristics: a taxonomy, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Fast local search algorithms for the handicapped persons transportation problem, Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem, Four-point conditions for the TSP: the complete complexity classification, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Fast neighborhood search for the single machine total weighted tardiness problem, An exact algorithm for the precedence-constrained single-machine scheduling problem, Metaheuristics in combinatorial optimization
Uses Software
