Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
DOI10.1007/S10589-010-9343-5zbMATH Open1219.90070OpenAlexW2064344559MaRDI QIDQ535306FDOQ535306
Authors: Grzegorz Waligóra 
Publication date: 11 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9343-5
Recommendations
- Solving the discrete-continuous project scheduling problem via its discretization
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- Comparative analysis of some metaheuristics for discrete-continuous project scheduling with activities of identical processing rates
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Solving the discrete-continuous project scheduling problem via its discretization
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Simulated annealing for multi-mode resource-constrained project scheduling
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- On a methodology for discrete-continuous scheduling
- Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
Cited In (13)
- Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
- Revenue sharing for resource transfer among projects
- Resource-constrained project scheduling with flexible resource profiles in continuous time
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Comparative analysis of some metaheuristics for discrete-continuous project scheduling with activities of identical processing rates
- Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
- Solving the discrete-continuous project scheduling problem via its discretization
- Scheduling shared continuous resources on many-cores
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- On a certain class of power- and energy-related scheduling problems
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
Uses Software
This page was built for publication: Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535306)
