Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
DOI10.1016/J.COR.2020.104886zbMATH Open1458.90340OpenAlexW2999083279WikidataQ126385391 ScholiaQ126385391MaRDI QIDQ2297569FDOQ2297569
Sérgio Ricardo de Souza, Rodney Oliveira Marinho Diana
Publication date: 20 February 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104886
Recommendations
- 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
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
- Variable neighborhood search: Principles and applications
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Variable neighborhood search
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- An electromagnetism-like mechanism for global optimization
- Probability distribution of solution time in GRASP: an experimental investigation
- A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Scheduling unrelated parallel machines with sequence-dependent setups
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- An iterated tabu search for the multi-compartment vehicle routing problem
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- An effective heuristic algorithm for the partial shop scheduling problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- A robust parameter design for multi-response problems
- 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
Cited In (4)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- General variable neighborhood search for the parallel machine scheduling problem with two common servers
- 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
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
This page was built for publication: Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297569)
