Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan

DOI10.1007/S10589-010-9343-5zbMath1219.90070OpenAlexW2064344559MaRDI QIDQ535306

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

zbMATH Keywords

project schedulingmakespanheuristiccontinuous resourcediscrete resource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Scheduling shared continuous resources on many-cores ⋮ Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource ⋮ Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ On a certain class of power- and energy-related scheduling problems ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Revenue sharing for resource transfer among projects ⋮ 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

Uses Software

• CFSQP

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• Single machine scheduling problem with a common deadline and resource dependent release dates
• On a methodology for discrete-continuous scheduling
• 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
• Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
• Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
• Simulated annealing for multi-mode resource-constrained project scheduling

This page was built for publication: Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan