General variable neighborhood search for the parallel machine scheduling problem with two common servers

DOI10.1007/s11590-022-01925-2OpenAlexW4296295624MaRDI 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

zbMATH Keywords

parallel machine schedulingmixed integer programgreedy heuristicsgeneral variable neighborhood searchtwo common servers

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

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

This page was built for publication: General variable neighborhood search for the parallel machine scheduling problem with two common servers