Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
From MaRDI portal
Recommendations
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- Tabu search for resource-constrained scheduling
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Probabilistic tabu search for makespan minimization discrete-continuous scheduling
- Tabu list management methods for a discrete-continuous scheduling problem
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
- scientific article; zbMATH DE number 1488068
- Tabu search for a class of single-machine scheduling problems
- Scheduling using tabu search methods with intensification and diversification
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Future paths for integer programming and links to artificial intelligence
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- Local search metaheuristics for discrete-continuous scheduling problems
- On a methodology for discrete-continuous scheduling
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu list management methods for a discrete-continuous scheduling problem
Cited in
(15)- Probabilistic tabu search for makespan minimization discrete-continuous scheduling
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Metaheuristics for multi-mode capital-constrained project payment scheduling
- Improved tabu search heuristics for the dynamic space allocation problem
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Resource level minimization in the discrete-continuous scheduling
- Comparative analysis of some metaheuristics for discrete-continuous project scheduling with activities of identical processing rates
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- Tabu list management methods for a discrete-continuous scheduling problem
This page was built for publication: Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954934)
