Multi-Neighborhood Search for the Makespan Minimization Problem on Parallel Identical Machines with Conflicting Jobs
- 18 June 2024
- book chapter
- Published by Springer Nature
- p. 373-379
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021Journal of Scheduling, 2022
- Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problemEURO Journal on Computational Optimization, 2022
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetablingComputers & Operations Research, 2021
- Maximising the Total Weight of On-Time Jobs on Parallel Machines Subject to a Conflict Graph2021
- An exact algorithm for parallel machine scheduling with conflictsJournal of Scheduling, 2016
- The irace package: Iterated racing for automatic algorithm configurationOperations Research Perspectives, 2016
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Optimization by Simulated AnnealingScience, 1983