A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:2270448
Recommendations
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times
Cites work
- A fast and effective heuristic for the orienteering problem
- A hybrid metaheuristic for the resource-constrained project scheduling problem
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- A new hybrid heuristic approach for solving large traveling salesman problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- An Optimal Algorithm for the Orienteering Tour Problem
- Effective optimization methods for single-machine scheduling (survey)
- Fundamentals of scatter search and path relinking
- scientific article; zbMATH DE number 4125195 (Why is no real title available?)
- scientific article; zbMATH DE number 1769325 (Why is no real title available?)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Principles of scatter search
- Scatter search for the vehicle routing problem with time windows
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Solving the Orienteering Problem through Branch-and-Cut
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Some aspects of scatter search in the flow-shop problem
- The orienteering problem
- The prize collecting traveling salesman problem
- The prize collecting traveling salesman problem: II. Polyhedral results
- The selective travelling salesman problem
- The vehicle routing problem
- Variable neighborhood search
Cited in
(9)- An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- The third comprehensive survey on scheduling problems with setup times/costs
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- The prize-collecting scheduling problem with deadlines
- A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
This page was built for publication: A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270448)
