Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
From MaRDI portal
Publication:6090472
DOI10.1111/itor.12738OpenAlexW2982020568MaRDI QIDQ6090472
Thiago Alves de Queiroz, Leandro Resende 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
makespanflow timesequence-dependent setup timeparallel machine scheduling problemmultiobjective variable neighborhood descent
Related Items (3)
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 bi-objective heuristic approach for green identical parallel machine scheduling
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
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Variable neighborhood search
- An exact algorithm for the identical parallel machine scheduling problem.
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Scheduling
- Variable neighborhood search: Principles and applications
This page was built for publication: Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
