A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem

DOI10.1016/J.COR.2023.106504MaRDI QIDQ6551102zbMATH OpenFDO

Authors George H. G. Fonseca, Guilherme B. Figueiroa, Túlio A. M. Toffolo

Publication date 6 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106504

zbMATH Keywords

fix-and-optimizemachine scheduling problemUPMSP

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• An integer programming approach to the multimode resource-constrained multiproject scheduling problem
• Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Decomposition methods for the parallel machine scheduling problem with setups
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems
• Integer programming techniques for the nurse rostering problem
• Integrating matheuristics and metaheuristics for timetabling
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

Cited in

(4)

• Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?
• Multi-commodity vehicle routing problem with pickup and delivery for electric micromobility devices rebalancing and battery swapping
• Integrated operating room scheduling and surgical instrument inventory management: models, algorithms, and cost-saving insights
• A modified adaptive large neighborhood search algorithm for solving network-shared manufacturing resource scheduling

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)