Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem

DOI10.1016/J.ENDM.2018.03.017zbMath1408.90348OpenAlexW2798094844WikidataQ129987456 ScholiaQ129987456MaRDI QIDQ1791932

Leandro Resende Mundim, Thiago Alves de Queiroz

Publication date: 11 October 2018

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

zbMATH Keywords

parallel machinesmakespanvariable neighborhood searchflow time

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• The third comprehensive survey on scheduling problems with setup times/costs
• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
• Variable neighborhood search
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Minimizing flowtime subject to optimal makespan on two identical parallel machines
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Scheduling

This page was built for publication: Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem