Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers
From MaRDI portal
Publication:6551084
DOI10.1016/j.cor.2023.106480MaRDI QIDQ6551084
Rachid Benmansour, Issam Krimi
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
parallel machine schedulingextreme learning machinegeneral variable neighborhood searchhealthcare services schedulingunrelated servers
Cites Work
- Scheduling with multiple servers
- Trends in extreme learning machines: a review
- Parallel machine scheduling problems with a single server
- Parallel machine scheduling with multiple unloading servers
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- Variable neighborhood search: basics and variants
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- Complexity results for parallel machine problems with a single server
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Single-server parallel-machine scheduling with loading and unloading times
- Mixed integer programming formulations for the biomass truck scheduling problem
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
- On the facial structure of scheduling polyhedra
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Handbook on Scheduling
- A logical calculus of the ideas immanent in nervous activity
- Scheduling
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- Variable neighborhood search: the power of change and simplicity
This page was built for publication: Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers