General variable neighborhood search for the parallel machine scheduling problem with two common servers
From MaRDI portal
Publication:6063516
DOI10.1007/s11590-022-01925-2MaRDI QIDQ6063516
Rachid Benmansour, Abdelhak Elidrissi, Angelo Sifaleras
Publication date: 7 November 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01925-2
parallel machine scheduling; mixed integer program; greedy heuristics; general variable neighborhood search; two common servers
90C11: Mixed integer programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Cites Work
- Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
- Scheduling with multiple servers
- Variable neighbourhood search: methods and applications
- Parallel machine scheduling with multiple unloading servers
- Variable neighborhood search
- 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
- A multiple-crane-constrained scheduling problem in a container terminal
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- Mixed integer programming formulations for the biomass truck scheduling problem
- The significance of reducing setup times/setup costs
- Scheduling two parallel semiautomatic machines to minimize machine interference
- Scheduling two parallel machines with a single server: the general case
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Online algorithms for scheduling two parallel machines with a single server
- On the facial structure of scheduling polyhedra
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS
- Scheduling parallel machines with a single server: Some solvable cases and heuristics