Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows

• DOI: 10.1016/j.entcs.2011.11.022
• Publication Date: 2011-12-30T23:39:08Z
• Authors: José Elias Claudi...; Rafael dos Santos...; Alcione de Paiva ...
• Keywords: Tardiness; Variable neighborhood search

In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. problem, consider minimizing total weighted earliness/tardiness flowtime criteria. We introduce two intensification procedures improve a VNS (MOVNS) algorithm proposed in literature. performance of is tested set medium larger instances problem. computational results show that outperform original MOVNS terms solution quality. A statistical analysis conducted order analyze methods.