Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties

DOI10.1016/j.endm.2018.03.007zbMath1408.90350OpenAlexW2796944632WikidataQ129988105 ScholiaQ129988105MaRDI QIDQ1791909

Marcone Jamilson Freitas Souza, Sérgio Ricardo de Souza, Bruno Ferreira Rosa

Publication date: 11 October 2018

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

zbMATH Keywords

single machine schedulingVNSsequence-dependent setup times

Mathematics Subject Classification ID

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

Cites Work

• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
• A survey on scheduling problems with due windows
• Scheduling

This page was built for publication: Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties