Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
From MaRDI portal
Recommendations
- Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
- Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- A variable neighborhood search algorithm for uniform parallel machine scheduling with release dates
- Exponential neighborhood search for a parallel machine scheduling problem
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
Cited in
(33)- Variable neighbourhood search: Methods and applications
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties
- Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
- A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
- VNS for scheduling independent tasks to identical processors
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- An iterative approach for the serial batching problem with parallel machines and job families
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?
- Variable neighbourhood search: methods and applications
This page was built for publication: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432690)
