Solving the discrete-continuous project scheduling problem via its discretization

DOI10.1007/s001860000094zbMath1023.90027OpenAlexW1963825388MaRDI QIDQ1401646

Grzegorz Waligóra, Marek Mika, Joanna Józefowska, Rafal Rózycki, Jan Weglarz

Publication date: 18 August 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860000094

zbMATH Keywords

simulated annealingmulti-mode project schedulingcontinuous resourcesdiscrete resources

Mathematics Subject Classification ID

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

Related Items (5)

Scheduling shared continuous resources on many-cores ⋮ MIP models for resource-constrained project scheduling with flexible resource profiles ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem

This page was built for publication: Solving the discrete-continuous project scheduling problem via its discretization