Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time

DOI10.1111/ITOR.12738MaRDI QIDQ6090472zbMATH OpenOpenAlexFDO

Authors Thiago Alves de Queiroz, Leandro R. Mundim

Publication date 17 November 2023

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12738

zbMATH Keywords

flow timemakespanmultiobjective variable neighborhood descentparallel machine scheduling problemsequence-dependent setup time

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An exact algorithm for the identical parallel machine scheduling problem.
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems
• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
• Scheduling
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• The third comprehensive survey on scheduling problems with setup times/costs
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(7)

• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
• A bi-objective heuristic approach for green identical parallel machine scheduling
• Two‐phase strategies for the bi‐objective minimum spanning tree problem
• A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• Assigning multi-skill configurations to multiple servers with a scenario-based planning and recombination approach
• The fourth comprehensive review of scheduling problems with setup times

This page was built for publication: Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090472)