A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
From MaRDI portal
Publication:6551102
DOI10.1016/J.COR.2023.106504MaRDI QIDQ6551102FDOQ6551102
Guilherme B. Figueiroa, Túlio A. M. Toffolo, George H. G. Fonseca
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Integer programming techniques for the nurse rostering problem
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem
- Integrating matheuristics and metaheuristics for timetabling
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Decomposition methods for the parallel machine scheduling problem with setups
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
This page was built for publication: A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551102)
