A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
From MaRDI portal
Publication:1762139
DOI10.1016/j.cor.2011.08.022zbMath1251.90157OpenAlexW2128250282WikidataQ59317582 ScholiaQ59317582MaRDI QIDQ1762139
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.022
single machine schedulingvariable neighborhood searchweighted tardinesssequence dependent setup time
Related Items (21)
Distributionally robust single machine scheduling with the total tardiness criterion ⋮ An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Two metaheuristic approaches for solving multidimensional two-way number partitioning problem ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ Variable neighborhood search: basics and variants ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ A matheuristic for the generalized order acceptance and scheduling problem ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Variable neighbourhood search: methods and applications
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Scheduling in a sequence dependent setup environment with genetic search
- Variable neighborhood search
- A survey of scheduling problems with setup times or costs
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- Variable neighborhood search and local branching
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Enhancing stochastic search performance by value-biased randomization of heuristics
- Minimizing Total Tardiness on One Machine is NP-Hard
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Variable Neighborhood Search
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Variable neighborhood search: Principles and applications
This page was built for publication: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
