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

DOI10.1016/j.endm.2018.03.025zbMath1408.90340OpenAlexW2798069495WikidataQ129989432 ScholiaQ129989432MaRDI QIDQ1791956

Yanyan Li

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.025

zbMATH Keywords

schedulingunrelated parallel machinestardinessvariable neighborhood descentiterated local searchsetup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

Cites Work

• Unnamed Item
• Scheduling unrelated parallel machines with sequence-dependent setups
• Variable neighborhood search
• Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: 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