Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem

DOI10.1016/J.ENDM.2012.10.015zbMath1268.90151OpenAlexW2064180409MaRDI QIDQ2840760

Hong Zhou, Le Liu

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

single machinevariable neighborhood searchrescheduling

Mathematics Subject Classification ID

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

Cites Work

• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• Variable neighborhood search
• Rescheduling for Multiple New Orders
• Rescheduling for New Orders

This page was built for publication: Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem