Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
From MaRDI portal
Publication:954934
DOI10.1016/j.ejor.2007.11.009zbMath1279.90073OpenAlexW2069464702MaRDI QIDQ954934
Publication date: 18 November 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.009
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates, An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information, Metaheuristics for multi-mode capital-constrained project payment scheduling, Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan, Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective, Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results, Resource level minimization in the discrete-continuous scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- On a methodology for discrete-continuous scheduling
- Local search metaheuristics for discrete-continuous scheduling problems
- Tabu list management methods for a discrete-continuous scheduling problem
- Future paths for integer programming and links to artificial intelligence
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem